Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1266
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Wang, JB | - |
dc.creator | Ng, CTD | - |
dc.creator | Cheng, TCE | - |
dc.date.accessioned | 2014-12-11T08:23:51Z | - |
dc.date.available | 2014-12-11T08:23:51Z | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1266 | - |
dc.language.iso | en | en_US |
dc.publisher | Pergamon Press | en_US |
dc.rights | Computers & Operations Research © 2007 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Single machine | en_US |
dc.subject | Deteriorating jobs | en_US |
dc.subject | Series-parallel graph | en_US |
dc.subject | Makespan | en_US |
dc.subject | Total weighted completion time | en_US |
dc.title | Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: C. T. Ng | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 2684 | - |
dc.identifier.epage | 2693 | - |
dc.identifier.volume | 35 | - |
dc.identifier.issue | 8 | - |
dc.identifier.doi | 10.1016/j.cor.2006.12.026 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Computers and operations research, Aug. 2008, v. 35, no. 8, p. 2684-2693 | - |
dcterms.isPartOf | Computers and operations research | - |
dcterms.issued | 2008-08 | - |
dc.identifier.isi | WOS:000253254500018 | - |
dc.identifier.scopus | 2-s2.0-36849012070 | - |
dc.identifier.eissn | 1873-765X | - |
dc.identifier.rosgroupid | r37877 | - |
dc.description.ros | 2007-2008 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
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
131
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
286
Citations as of Apr 21, 2024
SCOPUSTM
Citations
67
Last Week
0
0
Last month
1
1
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
69
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.