Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1157
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/1157 | - |
dc.language.iso | en | en_US |
dc.publisher | Palgrave Macmillan | en_US |
dc.rights | © 2004 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. Kang and C.T. Ng, Journal of the Operational Research Society, 55, 198–203 (2004) is available online at: http://www.palgrave-journals.com/jors/journal/v55/n2/abs/2601681a.html. | en_US |
dc.subject | Single machine scheduling | en_US |
dc.subject | Due-date | en_US |
dc.subject | Deteriorating jobs | en_US |
dc.title | Due-date assignment and single 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. Kang | en_US |
dc.description.otherinformation | Author name used in this publication: C. T. Ng | en_US |
dc.identifier.spage | 198 | - |
dc.identifier.epage | 203 | - |
dc.identifier.volume | 55 | - |
dc.identifier.doi | 10.1057/palgrave.jors.2601681 | - |
dcterms.abstract | We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of the Operational Research Society, 2004, v. 55, p. 198-203 | - |
dcterms.isPartOf | Journal of the Operational Research Society | - |
dcterms.issued | 2004 | - |
dc.identifier.isi | WOS:000188741300012 | - |
dc.identifier.scopus | 2-s2.0-2342656496 | - |
dc.identifier.eissn | 1476-9360 | - |
dc.identifier.rosgroupid | r18705 | - |
dc.description.ros | 2003-2004 > 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 |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
du32.pdf | Pre-published version | 155.01 kB | Adobe PDF | View/Open |
Page views
153
Last Week
1
1
Last month
Citations as of Dec 15, 2024
Downloads
275
Citations as of Dec 15, 2024
SCOPUSTM
Citations
79
Last Week
0
0
Last month
1
1
Citations as of Dec 19, 2024
WEB OF SCIENCETM
Citations
75
Last Week
0
0
Last month
0
0
Citations as of Dec 19, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.