Please use this identifier to cite or link to this item:
|Title:||Due-date assignment and single machine scheduling with deteriorating jobs|
|Authors:||Cheng, T. C. Edwin|
Ng, Chi-to Daniel
|Subjects:||Single machine scheduling|
|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.
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|du32.pdf||Pre-published version||155.01 kB||Adobe PDF||View/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.