Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1143
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | He, Y | - |
dc.creator | Wei, Q | - |
dc.creator | Cheng, TCE | - |
dc.date.accessioned | 2014-12-11T08:22:52Z | - |
dc.date.available | 2014-12-11T08:22:52Z | - |
dc.identifier.issn | 1094-6136 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1143 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.rights | © 2007 Springer Science + Business Media, Inc. The original publication is available at www.springerlink.com. | en_US |
dc.subject | Single-machine scheduling problem | en_US |
dc.subject | Pseudo-polynomial time algorithm | en_US |
dc.subject | Strongly polynomial time algorithm | en_US |
dc.subject | Controllable processing times | en_US |
dc.title | Single-machine scheduling with trade-off between number of tardy jobs and compression cost | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 303 | - |
dc.identifier.epage | 310 | - |
dc.identifier.volume | 10 | - |
dc.identifier.issue | 4-5 | - |
dc.identifier.doi | 10.1007/s10951-007-0027-7 | - |
dcterms.abstract | We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off curve between the number of tardy jobs and the maximum compression cost, we present a polynomial time algorithm. Furthermore, we extend the problem to the case of discrete controllable processing times, where the processing time of a job can only take one of several given discrete values. We show that even some special cases of the discrete controllable version with the objective of minimizing the total compression cost are NP-hard, but the general case is solvable in pseudo-polynomial time. Moreover, we present a strongly polynomial time algorithm to construct the trade-off curve between the number of tardy jobs and the maximum compression cost for the discrete controllable version. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of scheduling, Oct. 2007, v. 10, no. 4-5, p. 303-310 | - |
dcterms.isPartOf | Journal of scheduling | - |
dcterms.issued | 2007-10 | - |
dc.identifier.isi | WOS:000249793100007 | - |
dc.identifier.scopus | 2-s2.0-34848892698 | - |
dc.identifier.eissn | 1099-1425 | - |
dc.identifier.rosgroupid | r36669 | - |
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 | |
---|---|---|---|---|
JOS-504E.pdf | Pre-published version | 197.8 kB | Adobe PDF | View/Open |
Page views
123
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
227
Citations as of Apr 21, 2024
SCOPUSTM
Citations
8
Last Week
0
0
Last month
0
0
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
6
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.