On single processor scheduling problems with learning dependent on the number of processed jobs

Applied Mathematical Modelling

Volumn 37, Issue 3, 2013, Pages 1523-1536

  Rudek, Radosław ^a,b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b WROCLAW UNIVERSITY OF ECONOMICS   (Poland)

Author keywords

Branch and bound; Computational complexity; Heuristic; Learning effect; Scheduling; Single processor

Indexed keywords

BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; COMPLETION TIME; ELIMINATION PROCEDURE; GENERAL MODEL; HEURISTIC; LEARNING EFFECTS; LEARNING MODELS; MAXIMUM LATENESS; NP-HARD; RELEASE DATE; SCHEDULING JOBS; SINGLE PROCESSORS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PROFITABILITY; SCHEDULING;

PROBLEM SOLVING;

EID: 84870244253     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2012.04.019     Document Type: Article

References (38)

1. D. Jackson, Technological change, the learning curve, and profitability, Edward Elgar, Northampton, Mass, 1998.
2. Kerzner H. Project Management: A System Approach to Planning, Scheduling, and Controlling 1998, John Wiley & Sons Inc., New York.
3. Nadler G., Smith W.D. Manufacturing progress functions for types of processes. Int. J. Prod. Res. 1963, 2:115-135.
4. Yelle L.E. The learning curve: historical review and comprehensive study. Decis. Sci. 1979, 10:302-328.
5. Wright T.P. Factors affecting the cost of airplanes. J. Aeronaut. Sci. 1936, 3:122-128.
6. Biskup D. Single-machine scheduling with learning considerations. Euro. J. Oper. Res. 1999, 115:173-178.
7. Cheng T.C.E., Wang G. Single machine scheduling with learning effect considerations. Ann. Oper. Res. 2000, 98:273-290.
8. Adler P.S., Clark K.B. Behind the learning curve: a sketch of the learning process. Manag. Sci. 1991, 37:267-281.
9. Webb G.K. Integrated circuit (IC) pricing. J. High. Technol. Manage. Res. 1994, 5:247-260.
10. Carlson J.G., Rowe R.G. How much does forgetting cost?. Ind. Eng. 1976, 8:40-47.
11. Cochran E.B. New concepts of the learning curve. J. Ind. Eng. 1960, 11:317-327.
12. H.P. Holzer, A. Riahi-Belkaoui, The learning curve: a management accounting tool, Quorum Books, Westport, CT, 1986.
13. Jaber Y.M., Bonney M. The economic manufacture/order quantity (EMQ/EOQ) and the learning curve: past, present, and future. Int. J. Prod. Econ. 1999, 59:93-102.
14. Lien T.K., Rasch F.O. Hybrid automatic-manual assembly systems. Ann. CIRP 2001, 50:21-24.
15. Arimoto S., Kawamura S., Miyazaki F. Bettering operations of robots by learning. J. Robotic Syst. 1984, 1:123-140.
16. Buşoniu L., BabuŠka R., De Schutter B. A comprehensive survey of multiagent reinforcement learning. IEEE T. Syst. Man Cybernet. C 2008, 38:156-172.
17. Grzech A., Świa̧tek P. Modeling and optimization of complex services in service-based systems. Cybernet. Syst. 2009, 40:706-723.
18. Mitchell T. Machine Learning 1997, McGraw-Hill, New York.
19. Świa̧tek P., Grzech A., Rygielski P. Adaptive packet scheduling for requests delay guaranties in packet-switched computer communication network. Syst. Sci. 2010, 36:7-12.
20. Sutton R.S., Barto A.G. Reinforcement Learning: An Introduction 1998, MIT Press, Cambridge.
21. Whiteson S., Stone P. Adaptive job routing and scheduling. Eng. Appl. Artif. Intel. 2004, 17:855-869.
22. Biskup D. A state-of-the-art review on scheduling with learning effects. Euro. J. Oper. Res. 2008, 188:315-329.
23. Janiak A., Rudek R. Experience based approach to scheduling problems with the learning effect. IEEE T. Syst. Man Cybernet. A 2009, 39:344-357.
24. Mosheiov G. Scheduling problems with a learning effect. Euro. J. Oper. Res. 2001, 132:687-693.
25. Bachman A., Janiak A. Scheduling jobs with position dependent processing times. J. Oper. Res. Soc. 2004, 55:257-264.
26. R. Rudek, A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times, Optim. Lett. in press. doi:10.1007/s11590-012-0445-0.
27. Lin B.M.T. Complexity results for single-machine scheduling with positional learning effects. J. Oper. Res. Soc. 2007, 58:1099-1102.
28. Janiak A., Rudek R. Viewpoint on: complexity results for single-machine scheduling with positional learning effects. J. Oper. Res. Soc. 2008, 59:1430.
29. R. Rudek, Scheduling problems with position dependent job processing times: computational complexity results, Ann. Oper. Res., in press. doi:10.1007/s10479-012-1098-1.
30. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 1979, 5:287-326.
31. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, Freeman, San Francisco.
32. Mosheiov G., Sidney J.B. Note on scheduling with general learning curves to minimize the number of tardy jobs. J. Oper. Res. Soc. 2005, 56:110-112.
33. Lee W.-C., Wu C.-C., Hsu P.-H. A single-machine learning effect scheduling problem with release times. OMEGA Int. J. Manage. Sci. 2010, 38:3-11.
34. Wu C.-C., Lee W.-C., Chen T. Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations. Comput. Ind. Eng. 2007, 52:124-132.
35. Moore J.M. An n jobs one machine sequencing algorithm for minimizing the number of late jobs. Manage. Sci. 1968, 15:102-109.
36. Nawaz M., Enscore E.E., Ham I.A. A heuristic algorithm for m-machine, n-jobs flow-shop sequencing problem. OMEGA Int. J. Manage. Sci. 1983, 11:91-95.
37. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220:671-680.
38. Wang J.-B., Huang X., Wang X.-Y., Yin N., Wang L.-Y. Learning effect and deteriorating jobs in the single machine scheduling problems. Appl. Math. Model. 2009, 33:3848-3853.