Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1266
Title: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
Authors: Wang, Ji-Bo
Ng, Chi-to Daniel
Cheng, T. C. Edwin
Subjects: Scheduling
Single machine
Deteriorating jobs
Series-parallel graph
Makespan
Total weighted completion time
Issue Date: Aug-2008
Publisher: Elsevier Ltd.
Source: Computers & operations research, Aug. 2008, v. 35, no. 8, p. 2684-2693.
Abstract: 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.
Rights: Computers & Operations Research © 2007 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/1266
DOI: 10.1016/j.cor.2006.12.026
ISSN: 0305-0548
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
new-w_jC_j-sp-digraphs-deterioration-new.pdfPre-published version161.95 kBAdobe PDFView/Open


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.