Please use this identifier to cite or link to this item:
|Title:||Due-date assignment and parallel-machine scheduling with deteriorating jobs|
|Authors:||Cheng, T. C. Edwin|
Ng, Chi-to Daniel
|Source:||Journal of the Operational Research Society, 2007, v. 58, 1103–1108.|
|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.|
|Rights:||© 2007 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.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.
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|JORS Paper #7713.pdf||Pre-published version||161.08 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.