Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Minimizing the total weighted completion time of deteriorating jobs
Autore:
Bachman, A; Janiak, A; Kovalyov, MY;
Indirizzi:
Wroclaw Univ Technol, Inst Engn Cybernet, PL-50372 Wroclaw, Poland WroclawUniv Technol Wroclaw Poland PL-50372 t, PL-50372 Wroclaw, Poland Natl Acad Sci Belarus, Inst Engn Cybernet, Minsk 220012, Byelarus Natl Acad Sci Belarus Minsk Byelarus 220012 rnet, Minsk 220012, Byelarus
Titolo Testata:
INFORMATION PROCESSING LETTERS
fascicolo: 2, volume: 81, anno: 2002,
pagine: 81 - 84
SICI:
0020-0190(20020131)81:2<81:MTTWCT>2.0.ZU;2-L
Fonte:
ISI
Lingua:
ENG
Soggetto:
SHAPED POLICIES;
Keywords:
scheduling; computational complexity; start time dependent processing time; deteriorating job; single machine;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
9
Recensione:
Indirizzi per estratti:
Indirizzo: Janiak, A Wroclaw Univ Technol, Inst Engn Cybernet, Janiszewskiego 11-17, PL-50372 Wroclaw, Poland Wroclaw Univ Technol Janiszewskiego 11-17 WroclawPoland PL-50372
Citazione:
A. Bachman et al., "Minimizing the total weighted completion time of deteriorating jobs", INF PROCESS, 81(2), 2002, pp. 81-84

Abstract

The paper deals with a single machine problem of scheduling jobs with start tune dependent processing tithes to minimize the total weighted completion time. The computational complexity of this problem was unknown for ten years. We prove that the problem is NP-hard. (C) 2002 Elsevier Science B.V. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 19/01/20 alle ore 20:17:29