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 1180.90143
Wang, Ji-Bo; Ng, C.T.; Cheng, T.C.E.
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. (English)
[J] Comput. Oper. Res. 35, No. 8, 2684-2693 (2008). ISSN 0305-0548

Summary: This paper considers single-machine scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. In addition, the jobs are related by a series-parallel graph. It is shown that, for the general linear problem to minimize the makespan, polynomial algorithms exist. It is also shown that for the proportional linear problem of minimization of the total weighted completion time, polynomial algorithms exist, too.
MSC 2000:
*90B35 Scheduling theory

Keywords: makespan; total weighted completion time

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