Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1156
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Kang, L | - |
dc.creator | Ng, CTD | - |
dc.date.accessioned | 2014-12-11T08:23:08Z | - |
dc.date.available | 2014-12-11T08:23:08Z | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1156 | - |
dc.language.iso | en | en_US |
dc.publisher | Palgrave Macmillan | en_US |
dc.rights | © 2007 Operational Research Society Ltd. | en_US |
dc.rights | This 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.subject | Deteriorating jobs | en_US |
dc.subject | Parallel-machine scheduling | en_US |
dc.subject | Due-date | en_US |
dc.title | Due-date assignment and parallel-machine scheduling with deteriorating jobs | 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.description.otherinformation | Author name used in this publication: L. Y. Kang | en_US |
dc.description.otherinformation | Author name used in this publication: C. T. Ng | en_US |
dc.identifier.spage | 1103 | - |
dc.identifier.epage | 1108 | - |
dc.identifier.volume | 58 | - |
dc.identifier.doi | 10.1057/palgrave.jors.2602225 | - |
dcterms.abstract | In 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.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of the Operational Research Society, 2007, v. 58, 1103–1108 | - |
dcterms.isPartOf | Journal of the Operational Research Society | - |
dcterms.issued | 2007 | - |
dc.identifier.isi | WOS:000247790600012 | - |
dc.identifier.scopus | 2-s2.0-34547359924 | - |
dc.identifier.eissn | 1476-9360 | - |
dc.identifier.rosgroupid | r39349 | - |
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 | |
---|---|---|---|---|
JORS Paper #7713.pdf | Pre-published version | 161.08 kB | Adobe PDF | View/Open |
Page views
124
Last Week
0
0
Last month
Citations as of Apr 14, 2024
Downloads
218
Citations as of Apr 14, 2024
SCOPUSTM
Citations
25
Last Week
0
0
Last month
1
1
Citations as of Apr 12, 2024
WEB OF SCIENCETM
Citations
22
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.