Solution algorithms for the makespan minimization problem with the general learning model

Computers and Industrial Engineering

Volumn 56, Issue 4, 2009, Pages 1301-1308

  Janiak, Adam ^a   Janiak, Władysław Adam ^a   Rudek, Radosław ^a   Wielgus, Agnieszka ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

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

Indexed keywords

BRANCH AND BOUND; BRANCH-AND-BOUND ALGORITHMS; DEPENDENT FUNCTIONS; GENERAL LEARNING; HEURISTIC; JOB PROCESSING TIME; LEARNING CURVES; LEARNING EFFECT; LEARNING MODELS; MAKESPAN MINIMIZATIONS; PROCESSING TIME; S-SHAPED; SCHEDULING PROBLEMS; SINGLE PROCESSOR; SOLUTION ALGORITHMS; STRONGLY NP-HARD;

COMPUTATIONAL COMPLEXITY; EDUCATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; LINEAR PROGRAMMING; PROBLEM SOLVING;

LEARNING ALGORITHMS;

EID: 67349111349     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.07.019     Document Type: Article

References (23)

1. Al-Anzi A., Allahverdi, and Kovalyov M.Y. Batching deteriorating items with applications in computer communication and reverse logistics. European Journal of Operational Research 182 (2007) 1002-1011
2. Bachman A., and Janiak A. Scheduling jobs with position dependent processing times. Journal of the Operational Research Society 55 (2004) 257-264
3. Biskup D. A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research 188 (2008) 315-329
4. Carlson J.G., and Rowe R.G. How much does forgetting cost?. Industrial Engineering 8 (1976) 40-47
5. Cheng T.C.E., and Wang G. Single machine scheduling with learning effect considerations. Annals of Operations Research 98 (2000) 273-290
6. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
7. Inderfurth K., Kovalyov M.Y., Ng C.T., and Werner F. Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables. International Journal of Production Economics 105 (2007) 345-356
8. Jackson D. Technological change, the learning curve, and profitability (1998), Edward Elgar, Northampton, Mass
9. Janiak A., and Rudek R. The learning effect: Getting to the core of the problem. Information Processing Letters 103 (2007) 183-187
10. Janiak A., and Rudek R. A new approach to the learning effect: Beyond the learning curve restrictions. Computers & Operations Research 35 (2008) 3727-3736
11. Jordan R.B. How to use the learning curve. National Association of Accountants Bulletin 39 (1965) 27-39
12. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
13. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics 20 (1997) 75-79
14. Kuo W.-H., and Yang D.-L. Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research 174 (2006) 1184-1190
15. Mosheiov G. Scheduling problems with a learning effect. European Journal of Operational Research 132 (2001) 687-693
16. Mosheiov G. Parallel machine scheduling with a learning effect. Journal of the Operational Research Society 52 (2001) 1-5
17. Mosheiov G., and Sarig A. A due-window assignment problem with position-dependent processing times. Journal of the Operational Research Society 59 (2008) 997-1003
18. Mosheiov G., and Sidney J.B. Scheduling with general job-dependent learning curves. European Journal of Operational Research 147 (2003) 665-670
19. Mosheiov G., and Sidney J.B. Note on scheduling with general learning curves to minimize the number of tardy jobs. Journal of the Operational Research Society 56 (2005) 110-112
20. Nawaz Jr. M., Enscore E.E., and Ham I.A. A heuristic algorithm for m-machine, n-jobs. Flow-shop sequencing problem. OMEGA International Journal of Management Science 11 (1983) 91-95
21. Ohba M. Inflexion S-shaped software reliability growth models. In: Hatoyama Y., and Osaki S. (Eds). Stochastic models in reliability theory (1984), Springer-Verlag, Merlin 144-162
22. Wu C.-C., Lee W.-C., and Chen T. Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations. Computers and Industrial Engineering 52 (2007) 124-132
23. Yelle L.E. The learning curve: Historical review and comprehensive study. Decision Science 10 (1979) 302-328