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, JB
Ng, CTD 
Cheng, TCE 
Keywords: 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 How to cite?
Journal: Computers & operations research 
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.
URI: http://hdl.handle.net/10397/1266
ISSN: 0305-0548
DOI: 10.1016/j.cor.2006.12.026
Rights: Computers & Operations Research © 2007 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
new-w_jC_j-sp-digraphs-deterioration-new.pdfPre-published version161.95 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

55
Last Week
0
Last month
1
Citations as of Jun 3, 2016

WEB OF SCIENCETM
Citations

55
Last Week
0
Last month
0
Citations as of Sep 24, 2016

Page view(s)

453
Last Week
0
Last month
Checked on Sep 25, 2016

Download(s)

483
Checked on Sep 25, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.