Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1157
PIRA download icon_1.1View/Download Full Text
Title: Due-date assignment and single machine scheduling with deteriorating jobs
Authors: Cheng, TCE 
Kang, L
Ng, CTD 
Issue Date: 2004
Source: Journal of the Operational Research Society, 2004, v. 55, p. 198-203
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.
Keywords: Single machine scheduling
Due-date
Deteriorating jobs
Publisher: Palgrave Macmillan
Journal: Journal of the Operational Research Society 
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/palgrave.jors.2601681
Rights: © 2004 Operational Research Society Ltd.
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.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
du32.pdfPre-published version155.01 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

82
Last Week
0
Last month
Citations as of May 22, 2022

Downloads

175
Citations as of May 22, 2022

SCOPUSTM   
Citations

72
Last Week
0
Last month
1
Citations as of May 12, 2022

WEB OF SCIENCETM
Citations

70
Last Week
0
Last month
0
Citations as of May 19, 2022

Google ScholarTM

Check

Altmetric


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