Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1143
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorHe, Y-
dc.creatorWei, Q-
dc.creatorCheng, TCE-
dc.date.accessioned2014-12-11T08:22:52Z-
dc.date.available2014-12-11T08:22:52Z-
dc.identifier.issn1094-6136-
dc.identifier.urihttp://hdl.handle.net/10397/1143-
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.rights© 2007 Springer Science + Business Media, Inc. The original publication is available at www.springerlink.com.en_US
dc.subjectSingle-machine scheduling problemen_US
dc.subjectPseudo-polynomial time algorithmen_US
dc.subjectStrongly polynomial time algorithmen_US
dc.subjectControllable processing timesen_US
dc.titleSingle-machine scheduling with trade-off between number of tardy jobs and compression costen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.identifier.spage303-
dc.identifier.epage310-
dc.identifier.volume10-
dc.identifier.issue4-5-
dc.identifier.doi10.1007/s10951-007-0027-7-
dcterms.abstractWe 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.bibliographicCitationJournal of scheduling, Oct. 2007, v. 10, no. 4-5, p. 303-310-
dcterms.isPartOfJournal of scheduling-
dcterms.issued2007-10-
dc.identifier.isiWOS:000249793100007-
dc.identifier.scopus2-s2.0-34848892698-
dc.identifier.eissn1099-1425-
dc.identifier.rosgroupidr36669-
dc.description.ros2007-2008 > Academic research: refereed > Publication in refereed journal-
dc.description.oapreprint_postprint-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
JOS-504E.pdfPre-published version197.8 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show simple item record
PIRA download icon_1.1View/Download Full Text

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Aug 28, 2020

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Jul 30, 2020

Page view(s)

468
Last Week
2
Last month
Citations as of Oct 20, 2020

Download(s)

611
Citations as of Oct 20, 2020

Google ScholarTM

Check

Altmetric


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