Language:   Search:   Contact
World of
Mathematics Database
»ZBMATH« MSC 2000
MSC 2010 Reviewer
Service Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1032.68019
Bachman, Aleksander; Janiak, Adam; Kovalyov, Mikhail Y.
Minimizing the total weighted completion time of deteriorating jobs. (English)
[J] Inf. Process. Lett. 81, No.2, 81-84 (2002). ISSN 0020-0190

Summary: The paper deals with a single machine problem of scheduling jobs with start time dependent processing times 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.
MSC 2000:
*68M20 Performance evaluation of computer systems, etc.

Keywords: Scheduling; Computational complexity; Start time dependent processing time; Deteriorating job; Single machine

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites

Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster