Abstract
As to learning effect, it may be more appropriate to assume that position-based learning takes place during machine setups only, while sum-of-processing-time-based learning occurs in considering the experience that workers have gained from producing jobs. Thus, in this paper, we consider sum-of-processing-time-based learning on job processing time and position-based learning on setup time in single-machine group scheduling problems. The objectives are to minimize the makespan and the total completion time, respectively. We provide two polynomial time algorithms to solve the makespan minimization problems. On the other hand, we also provide two polynomial time algorithms to solve the total completion time minimization problems under certain conditions.
Similar content being viewed by others
References
Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173–178.
Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315–329.
Cheng, T. C. E., Ding, O., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1–13.
Cheng, T. C. E., Wu, C.-C., & Lee, W.-C. (2008). Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Information Sciences, 178, 2476–2487.
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 of Discrete Mathematics, 5, 287–326.
Hardy, G. H., Littlewood, J. E., & Polya, G. (1967). Inequalities. London: Cambridge University Press.
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–32). Warszawa: WKL.
Koulamas, C., & Kyparisis, G. J. (2007). Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research, 178, 402–407.
Kuo, W.-H., & Yang, D.-L. (2006a). Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174, 1184–1190.
Kuo, W.-H., & Yang, D.-L. (2006b). Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research, 33, 2099–2112.
Lee, W.-C., & Wu, C.-C. (2009). A note on single-machine group scheduling problems with position-based learning effect. Applied Mathematical Modelling, 33, 2159–2163.
Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, 665–670.
Wang, J. B., & Xia, Z. Q. (2005). Flow-shop scheduling with a learning effect. The Journal of the Operational Research Society, 56, 1325–1330.
Wu, C.-C., & Lee, W.-C. (2008). Single-machine scheduling problems with a learning effect. Applied Mathematical Modelling, 32, 1191–1197.
Yin, Y., Xu, D., Sun, K., & Li, H. (2009). Some scheduling problems with general position-dependent and time-dependent learning effects. Information Sciences, 179, 2416–2425.
Acknowledgements
This research was supported in part by the National Science Council of Taiwan, Republic of China, under grant number NSC-98-2221-E-150-032.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kuo, WH. Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect. Ann Oper Res 196, 349–359 (2012). https://doi.org/10.1007/s10479-012-1111-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-012-1111-8