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 |
Issue Date: | Aug-2008 | Source: | Computers and 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. | Keywords: | Scheduling Single machine Deteriorating jobs Series-parallel graph Makespan Total weighted completion time |
Publisher: | Pergamon Press | Journal: | Computers and operations research | ISSN: | 0305-0548 | EISSN: | 1873-765X | 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 | Size | Format | |
---|---|---|---|---|
new-w_jC_j-sp-digraphs-deterioration-new.pdf | Pre-published version | 161.95 kB | Adobe PDF | View/Open |
Page views
130
Last Week
0
0
Last month
Citations as of Apr 14, 2024
Downloads
285
Citations as of Apr 14, 2024
SCOPUSTM
Citations
67
Last Week
0
0
Last month
1
1
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
69
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.