Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration
Machine scheduling problems in just-in-time production environments are important issues in modern operations management to satisfy customer demand for superior service. In this paper, we investigate single-machine scheduling problems with simultaneous considerations of the effects of deterioration and learning. Due to the deteriorating effect, maintenance may be performed on the machine to improve its production efficiency. We assume that at most one maintenance is allowed throughout the scheduling horizon. We further assume that the maintenance duration depends on its starting time. Our goal is to find jointly the optimal time to perform the maintenance, the optimal location of the due-window, and the optimal job sequence such that the total cost that includes earliness, tardiness, and due-window size and location penalties is minimized. We also aim to investigate the makespan, the total completion time, and the total absolute deviation of completion times minimization problems. We propose polynomial time algorithms for all the studied problems.
KeywordsSchedule Problem Completion Time Polynomial Time Algorithm Total Completion Time Short Processing Time
We thank the editors and the anonymous reviewers for their helpful comments and suggestions on an earlier version of the paper. This research was supported by the National Science Council of Taiwan, Republic of China, under grant number NSC 100-2221-E-252-002-MY2.
- 9.Cheng, T.C.E., Kovalyov, M.: Scheduling with learning effects on job processing times. Working Paper 06/94, Faculty of Business and Information Systems, The Hong Kong Polytechnic University (1994)Google Scholar
- 11.Cheng, T.C.E., Yang, S.J., Yang, D.L.: Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. International Journal of Production Economics doi:10.1016/j.ijpe.2010.10.005Google Scholar
- 16.Graham, R., Lawler, E., J.K., L., Rinnooy Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)Google Scholar
- 18.Hardy, G., Littlewood, J., Polya, G.: Inequalities. Cambridge University Press, London (1967)Google Scholar
- 21.Janiak, A., Kovalyov, M.Y.: Scheduling deteriorating jobs. In: A. Janiak (ed.) Scheduling in Computer and Manufacturing Systems, pp. 12–25. WKL, Warszawa, Poland (2006)Google Scholar
- 22.Janiak, A., Rudek, R.: Scheduling problems with position dependent job processing times. In: A. Janiak (ed.) Scheduling in Computer and Manufacturing Systems, pp. 26–32. WKL, Warszawa, Poland (2006)Google Scholar
- 26.Kubzin, M., Strusevich, V.: Two-machine flow shop no-wait scheduling with machine maintenance. 4OR: A Quarterly Journal of Operations Research 3, 303–313 (2005)Google Scholar
- 31.Lee, W.C.: A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics 3, 83–89 (2004)Google Scholar
- 47.Toksar, M., Oron, D., Güner, E.: Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning. Computers & Mathematics with Applications 50, 401–406 (2009)Google Scholar