Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1156
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorKang, L-
dc.creatorNg, CTD-
dc.date.accessioned2014-12-11T08:23:08Z-
dc.date.available2014-12-11T08:23:08Z-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/10397/1156-
dc.language.isoenen_US
dc.publisherPalgrave Macmillanen_US
dc.rights© 2007 Operational Research Society Ltd.en_US
dc.rightsThis is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version T.C.E. Cheng, L.Y. Kang and C.T. Ng, Journal of the Operational Research Society, 58, 1103–1108 (2007) is available online at: http://www.palgrave-journals.com/jors/journal/v58/n8/abs/2602225a.html.en_US
dc.subjectDeteriorating jobsen_US
dc.subjectParallel-machine schedulingen_US
dc.subjectDue-dateen_US
dc.titleDue-date assignment and parallel-machine scheduling with deteriorating jobsen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.description.otherinformationAuthor name used in this publication: L. Y. Kangen_US
dc.description.otherinformationAuthor name used in this publication: C. T. Ngen_US
dc.identifier.spage1103-
dc.identifier.epage1108-
dc.identifier.volume58-
dc.identifier.doi10.1057/palgrave.jors.2602225-
dcterms.abstractIn this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job's processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuristic algorithm to find near-optimal solutions for the problem. When the due-date penalty is 0, we present a polynomial time algorithm to solve it.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationJournal of the Operational Research Society, 2007, v. 58, 1103–1108-
dcterms.isPartOfJournal of the Operational Research Society-
dcterms.issued2007-
dc.identifier.isiWOS:000247790600012-
dc.identifier.scopus2-s2.0-34547359924-
dc.identifier.eissn1476-9360-
dc.identifier.rosgroupidr39349-
dc.description.ros2007-2008 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
JORS Paper #7713.pdfPre-published version161.08 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

190
Last Week
0
Last month
Citations as of Aug 13, 2025

Downloads

263
Citations as of Aug 13, 2025

SCOPUSTM   
Citations

25
Last Week
0
Last month
1
Citations as of Sep 12, 2025

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
0
Citations as of Oct 30, 2025

Google ScholarTM

Check

Altmetric


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