Technical Note
Journal of the Operational Research Society (2008) 59, 416–420; doi:10.1057/palgrave.jors.2602363 Published online 3 January 2007
Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
1National Formosa University, Yun-Lin, Taiwan, ROC
Correspondence: D-L Yang, Department of Information Management, National Formosa University, 64 Wenhua Rd, Huwei, Yun-Lin, Taiwan 632, ROC. E-mail: dlyang@nfu.edu.tw
Received September 2005; Accepted September 2006; Published online 3 January 2007.
Abstract
In this paper, we study a single-machine scheduling problem with the cyclic process of an aging effect. This phenomenon appears in many realistic production processes. Thus, it is important to consider the phenomenon in scheduling problems. We analyse the single-machine makespan scheduling problem with two different aging effect models and provide a polynomial time algorithm to solve the problem.
Keywords:
single-machine, aging effect, makespan
MORE ARTICLES LIKE THIS
These links to content published by Palgrave Macmillan are automatically generated.
RESEARCH
Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effectJournal of the Operational Research Society Technical Note
Single machine scheduling with a time-dependent learning effect and deteriorating jobsJournal of the Operational Research Society Technical Note
A note on due-date assignment and single-machine scheduling with deteriorating jobsJournal of the Operational Research Society Technical Note
A note on unrelated parallel machine scheduling with time-dependent processing timesJournal of the Operational Research Society Technical Note
See all 40 matches for Research
