Single-machine scheduling with both deterioration and learning effects

Annals of Operations Research

Volumn 172, Issue 1, 2009, Pages 315-327

  Yang, Dar Li ^a   Kuo, Wen Hung ^a  

^a NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

Deterioration; Learning effect; Polynomial algorithms; Scheduling; Single machine

Indexed keywords

EID: 72249093773     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-009-0615-3     Document Type: Article

References (44)

1. Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: review and extensions. Journal of the Operational Research Society, 50, 711-729.
2. Bachman, A., & Janiak, A. (2000). Minimizing maximum lateness under linear deterioration. European Journal of Operational Research, 126, 557-566.
3. Bachman, A., & Janiak, A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55, 257-264.
4. Bachman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81, 81-84.
5. Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173-178.
6. Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315-329.
7. Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495-498.
8. Cheng, T. C. E., Ding, Q., Kovalyov, M. Y., Bachman, A., & Janiak, A. (2003). Scheduling jobs with piecewise linear decreasing processing times. Naval Research Logistics, 50, 531-532.
9. Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004a). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1-13.
10. Cheng, T. C. E., Kang, L., & Ng, C. T. (2004b). Due-date assignment and single machine scheduling with deteriorating jobs. Journal of the Operational Research Society, 55, 198-203.
11. Cheng, T. C. E., Wu, C. C., & Lee, W. C. (2008). Some scheduling problems with deteriorating jobs and learning effects. Computers & Industrial Engineering, 54, 972-982.
12. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Mathematics, 5, 287-326.
13. Hardy, G. H., Littlewood, J. E., & Polya, G. (1967). Inequalities. London: Cambridge University Press.
14. Inderfurth, K., Janiak, A., Kovalyov, M. Y., & Werner, F. (2006). Batching work and rework processes with limited deterioration of reworkables. Computers & Operations Research, 33, 1595-1605.
15. Janiak, A., & Kovalyov, M. Y. (2006). Job sequencing with exponential functions of processing times. Informatica, 17, 13-24.
16. Janiak, A., & Mikhail, K. Y. (2006). Scheduling deteriorating jobs. In A. Janiak (Ed.), Scheduling in computer and manufacturing systems (pp. 12-25). Warszawa, WKL.
17. Janiak, A., & Rudek, R. (2006). Scheduling problems with position dependent job processing times. In A. Janiak (Ed.), Scheduling in computer and manufacturing systems (pp. 26-38). Warszawa, WKL.
18. Janiak, A., & Rudek, R. (2007). The learning effect: Getting to the core of the problem. Information Processing Letters, 103, 183-187.
19. Janiak, A., & Rudek, R. (2008a). A new approach to the learning effect: Beyond the learning curve restrictions. Computers & Operations Research, 35, 3727-3736.
20. Janiak, A., & Rudek, R. (2008b). Viewpoint on: Complexity results for single-machine scheduling with positional learning effects. Journal of the Operational Research Society, 59, 1430.
21. Janiak, A., & Rudek, R. (2008c). Experience based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man, and Cybernetics - Part A. doi: 10. 1109/TSMCA. 2008. 2010757.
22. Janiak, A., Janiak, W., Rudek, R., & Wielgus, A. (2009). Solution algorithms for the makespan minimization problem with the general learning model. Computers and Industrial Engineering, 56, 1301-1308.
23. Kanet, J. J. (1981). Minimizing variation of Flow Time in Single Machine Systems. Management Science, 27, 1453-1459.
24. Kunnathur, A. S., & Gupta, S. K. (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research, 47, 56-64.
25. Kuo, W. H., & Yang, D. L. (2006a). Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research, 33, 2099-2112.
26. Kuo, W. H., & Yang, D. L. (2006b). Minimizing the total completion time in a single machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174(2), 1184-1190.
27. Kuo, W. H., & Yang, D. L. (2007). Single machine scheduling with past-sequence-dependent setup times and learning effects. Information Processing Letters, 102, 22-26.
28. Lee, W. C. (2004). A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics, 3, 83-89.
29. Lee, W. C., Wu, C. C., & Sung, H. J. (2004). A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica, 40, 303-315.
30. Lin, B. M. T. (2007). Complexity results for single-machine scheduling with positional learning effects. Journal of the Operational Research Society, 58, 1099-1102.
31. Mosheiov, G. (1991). V-shaped policies for scheduling deteriorating jobs. Operations Research, 39, 979-991.
32. Mosheiov, G. (1994). Scheduling deteriorating jobs under simple linear deterioration. Computers and Operations Research, 21, 653-659.
33. Mosheiov, G. (1995). Scheduling jobs with step-deterioration: minimizing makespan on a single- and multi-machine. Computers and Industrial Engineering, 28, 869-879.
34. Mosheiov, G. (1996). Λ-shape policies for schedule deteriorating jobs. Journal of the Operational Research Society, 47, 1184-1191.
35. Mosheiov, G. (2001). Scheduling problems with learning effect. European Journal of Operational Research, 132, 687-693.
36. Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, 665-670.
37. Ng, C. T., Cheng, T. C. E., Bachman, A., & Janiak, A. (2002). Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters, 81, 327-333.
38. Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391-399.
39. Townsend, W. (1978). The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Management Science, 24, 530-534.
40. Wang, J. B. (2007). Single-machine scheduling problems with the effects of learning and deterioration. Omega, 35, 397-402.
41. Wang, X., & Cheng, T. C. E. (2007a). Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research, 178, 57-70.
42. Wang, J. B., & Cheng, T. C. E. (2007b). Scheduling problems with the effects of deterioration and learning. Asia-Pacific Journal of Operational Research, 24, 245-261.
43. Wang, J. B., Lin, L., & Shan, F. (2008). Flow shop Scheduling with effects of learning and deterioration. Journal of Applied Mathematics and Computing, 26, 367-379.
44. Wu, C. C., & Lee, W. C. (2009). A note on the total completion time problem in a permutation flowshop with a learning effect. European Journal of Operational Research, 192, 343-347.