Single-machine scheduling problems with time and position dependent processing times

Annals of Operations Research

Volumn 186, Issue 1, 2011, Pages 345-356

  Zhang, Xingong ^a   Yan, Guangle ^a   Huang, Wanzhen ^b   Tang, Guochun ^c  

^a UNIVERSITY OF SHANGHAI FOR SCIENCE AND TECHNOLOGY   (China)

^b LAKEHEAD UNIVERSITY   (Canada)

^c SHANGHAI SECOND POLYTECHNIC UNIVERSITY   (China)

Author keywords

Learning effect; Performance ratio; Single machine scheduling; Worst case error

Indexed keywords

EID: 79958799313     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-011-0835-1     Document Type: Article

References (28)

1. Bachman, A., Cheng, T. C. E., Janiak, A., & Ng, C. T. (2002). Scheduling start time dependent jobs to minimize the total weighted completion time. Journal of the Operational Research Society, 53, 688-693.
2. Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173-178.
3. Biskup, D. (2008). A state-of-the-art review on scheduling with learning effect. European Journal of Operational Research, 188, 315-329.
4. Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495-498.
5. Cheng, T. C. E., & Wang, G. (2000). Single machine scheduling problems with learning effect considerations. Annal of Operations Research, 98, 273-290.
6. Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer.
7. 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.
8. Gupta, J. N. D., & Gupta, S. K. (1988). Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering, 14, 387-393.
9. Ho, K. I. J., Leung, J. Y. T., & Wei, W. D. (1993). Complexity of scheduling tasks with time-dependent execution times. Information Processing Letter, 48, 315-320.
10. Kise, H., Ibaraki, T., & Mine, H. (1979). Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the. Operational Research, Society of Japan, 22, 205-224.
11. 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.
12. Lee, W. C., & Wu, C. C. (2009). Some single-machine and m-machine flowshop scheduling problems with learning considerations. Information Sciences, 179(7), 3885-3892.
13. Mosheiov, G. (1991). V-shaped policies for scheduling deteriorating jobs. Operations Research, 39, 979-991.
14. Mosheiov, G. (1994). Scheduling jobs under simple linear deterioration. Computers and Operations Research, 21, 653-659.
15. Mosheiov, G. (2001). Scheduling problems with a learning effect. European of Journal Operation Research, 132, 687-692.
16. Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European of Journal Operation Research, 147, 665-670.
17. Mosheiov, G., & Sidney, J. B. (2005). Note on scheduling with general learning curves to minimize the number of tardy jobs. Journal of Operation Research Society, 56, 110-112.
18. Pegels, C. C. (1969). On startup or learning curves: an expanded view. AIIE Transactions, 1, 316-322.
19. Pinedo, M. (2008). Scheduling: Theory algorithms and systems. Prentice-Hall: Englewood Cliffs.
20. Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics, 3, 59-66.
21. Wang, J. B. (2005). Flow shop scheduling jobs with position-dependent processing times. Journal of Applied Mathematics and Computing, 18, 383-391.
22. Wang, J. B., & Cheng, T. C. E. (2007). Scheduling problems with the effects of deterioration and learning. Asia-Pacific Journal of Operational Research, 24, 245-261.
23. Wang, J. B., Liu, L. L. (2009). Two-machine flow shop scheduling with linear decreasing job deterioration. Computer and Industrial Engineering, 56, 1487-1493.
24. Wang, J. B., & Xia, Z. Q. (2005). Flow-shop scheduling with a learning effect. Journal of the Operational Research Society, 56, 1325-1330.
25. Wang, J. B., Wang, D., Wang, L. Y., Lin, L., Yin, N., & Wang, W. W. (2009). Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times. Computers and Mathematics with Applications, 57, 9-16.
26. Wang, J. B., Sun, L., & Sun, L. (2010). Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect. Applied Mathematics and Modelling, 34, 2813-2819.
27. Yang, S. J. (2010). Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration. Applied Mathematics and Computation, 217, 3321-3329.
28. Yang, D. L., & Kuo, W. H. (2010). Some scheduling problems with deteriorating jobs and learning effects. Computers and Industrial Engineering, 58, 25-28.