A single-machine learning effect scheduling problem with release times

Omega

Volumn 38, Issue 1-2, 2010, Pages 3-11

  Lee, Wen Chiung ^a   Wu, Chin Chia ^a   Hsu, Peng Hsiang ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Learning effect; Makespan; Release time; Single machine

Indexed keywords

BRANCH AND BOUND METHOD; LEARNING ALGORITHMS; LEARNING SYSTEMS; OPTIMAL SYSTEMS; SCHEDULING ALGORITHMS;

BRANCH-AND-BOUND ALGORITHMS; DOMINANCE PROPERTIES; LEARNING EFFECTS; LOW BOUND; MACHINE-LEARNING; MAKESPAN; RELEASE TIME; SCHEDULING PROBLEM; SINGLE MACHINE PROBLEMS; SINGLE- MACHINES;

HEURISTIC ALGORITHMS;

EID: 69549130676     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2009.01.001     Document Type: Article

References (25)

1. Heiser J., and Render B. Operations management. 5th ed. (1999), Prentice-Hall, Englewood Cliffs, NJ
2. Russell R., and Taylor B.W. Operations management: multimedia version. 3rd ed. (2000), Prentice-Hall, Upper Saddle River, NJ
3. Wang F.K., and Lee W. Learning curve analysis in total productive maintenance. OMEGA-The International Journal of Management Science 29 (2001) 491-499
4. Biskup D. Single-machine scheduling with learning considerations. European Journal of Operational Research 115 (1999) 173-178
5. Gawiejnowicz S. A note on scheduling on a single processor with speed dependent on a number of executed jobs. Information Processing Letters 56 (1996) 297-300
6. Dondeti V.R., and Mohanty B.B. Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs. European Journal of Operational Research 105 (1998) 509-524
7. Cheng T.C.E., and Wang G. Single machine scheduling with learning effect considerations. Annals of Operations Research 98 (2000) 273-290
8. Mosheiov G. Scheduling problems with a learning effect. European Journal of Operational Research 132 (2001) 687-693
9. Lee W.C., Wu C.C., and Sung H.J. A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica 40 (2004) 303-315
10. Lee W.C., and Wu C.C. Minimizing total completion time in a two-machine flowshop with a learning effect. International Journal of Production Economics 88 (2004) 85-93
11. Wang J.B., and Xia Z.Q. Flow-shop scheduling with a learning effect. Journal of the Operational Research Society 56 (2005) 1325-1330
12. Chen P., Wu C.C., and Lee W.C. A bi-criteria two-machine flowshop scheduling problem with a learning effect. Journal of the Operational Research Society 57 (2006) 1113-1125
13. Wang J.B. A note on scheduling problems with learning effects and deteriorating jobs. International Journal of Systems Science 37 (2006) 827-833
14. Eren T., and Güner E. Minimizing total tardiness in a scheduling problem with a learning effect. Applied Mathematical Modelling 31 (2007) 1351-1361
15. Wu C.C., and Lee W.C. A note on the total completion time problem in a permutation flowshop with a learning effect. European Journal of Operational Research 192 (2009) 343-347
16. Koulamas C., and Kyparisis G.J. Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research 178 (2007) 402-407
17. Wang J.B. Single-machine scheduling problems with the effects of learning and deterioration. OMEGA-The International Journal of Management Science 35 (2007) 397-402
18. Janiak A., and Rudek R. The learning effect: getting to the core of the problem. Information Processing Letters 103 (2007) 183-187
19. Bachman A., and Janiak A. Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society 55 (2004) 257-264
20. Janiak A., and Rudek R. A new approach to the learning effect: beyond the learning curve restrictions. Computers & Operations Research 35 (2008) 3727-3736
21. Janiak A, Janiak W, Rudek R, Wielgus A. Solution algorithms for the makespan minimization problem with the general learning model, Computers & Industrial Engineering 2008, doi:10.1016/j.cie.2008.07.019.
22. Biskup D. A state-of-the-art review on scheduling with learning effect. European Journal of Operational Research 188 (2008) 315-329
23. French S. Sequencing and scheduling: an introduction to the mathematics of the job shop (1982), Ellis Horwood Limited
24. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA: The International Journal of Management Science 11 (1983) 91-95
25. Chu C.B. A branch-and-bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics 39 (1992) 859-875