Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1157
Title: Due-date assignment and single machine scheduling with deteriorating jobs
Authors: Cheng, T. C. Edwin
Kang, Liying
Ng, Chi-to Daniel
Subjects: Single machine scheduling
Due-date
Deteriorating jobs
Issue Date: 2004
Publisher: Palgrave Macmillan
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.
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.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/1157
DOI: 10.1057/palgrave.jors.2601681
ISSN: 0160-5682
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
du32.pdfPre-published version155.01 kBAdobe PDFView/Open


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.