Due-date assignment and parallel-machine scheduling with deteriorating jobs

Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1156

Title:	Due-date assignment and parallel-machine scheduling with deteriorating jobs
Authors:	Cheng, TCE Kang, L Ng, CTD
Issue Date:	2007
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.
Keywords:	Deteriorating jobs Parallel-machine scheduling Due-date
Publisher:	Palgrave Macmillan
Journal:	Journal of the Operational Research Society
ISSN:	0160-5682
EISSN:	1476-9360
DOI:	10.1057/palgrave.jors.2602225
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:	Journal/Magazine Article

File	Description	Size	Format
JORS Paper #7713.pdf	Pre-published version	161.08 kB	Adobe PDF	View/Open

Status	open access
File Version	Final Accepted Manuscript

View full-text via PolyU eLinks

90

Last Week
0

Last month

Citations as of May 28, 2023

196

Citations as of May 28, 2023

25

Last Week
0

Last month
1

Citations as of May 25, 2023

22

Last Week
0

Last month
0

Citations as of May 25, 2023

Check