Technical Note
Journal of the Operational Research Society (2008) 59, 857–859; doi:10.1057/palgrave.jors.2602396 Published online 21 March 2007
A note on due-date assignment and single-machine scheduling with deteriorating jobs
1National Formosa University, Yun-Lin, Taiwan, ROC
Correspondence: DL Yang, Department of Information Management, National Formosa University, 64, Wen-Hua Road, Hu-Wei, Yun-Lin, Taiwan 632, ROC E-mail: dlyang@nfu.edu.tw
Received March 2006; Accepted December 2006; Published online 21 March 2007.
Abstract
In this note, we study a single-machine scheduling problem with deteriorating jobs whose processing times are an increasing function of their start times. The objective is to determine the optimal due-date and schedule simultaneously to minimize the total of due-date, earliness and tardiness penalties. We give a concise analysis of the problem and provide a polynomial time algorithm to solve the problem. Moreover, the algorithm can be easily applied to the 'mirror' scheduling problem in which the actual processing time of a job is a decreasing function of its starting time.
Keywords:
scheduling, deteriorating jobs, due-date, earliness, tardiness
MORE ARTICLES LIKE THIS
These links to content published by Palgrave Macmillan are automatically generated.
RESEARCH
A note on due-date assignment and single-machine scheduling with deteriorating jobsJournal of the Operational Research Society Technical Note
Due-date assignment and parallel-machine scheduling with deteriorating jobsJournal of the Operational Research Society Technical Note
Λ-Shaped Policies to Schedule Deteriorating JobsJournal of the Operational Research Society Technical Note
On the Assignment of Optimal Due DatesJournal of the Operational Research Society Technical Note
Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effectJournal of the Operational Research Society Technical Note
See all 13 matches for Research

