Worst-case analysis for flow shop scheduling problems with an exponential learning effect

Journal of the Operational Research Society

Volumn 63, Issue 1, 2012, Pages 130-137

  Wang, J B ^a   Wang, M Z ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

flow shop; learning effect; scheduling; worst case analysis

Indexed keywords

HEURISTIC ALGORITHMS; JOB SHOP SCHEDULING; MACHINE SHOP PRACTICE; SCHEDULING;

FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; LEARNING EFFECTS; QUADRATIC JOB COMPLETION TIME; SINGLE MACHINE PROBLEMS; SINGLE MACHINE SCHEDULING PROBLEMS; TOTAL WEIGHTED COMPLETION TIME; WORST-CASE ANALYSIS;

SCHEDULING ALGORITHMS;

EID: 82955165759     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.40     Document Type: Article

References (34)

1. Bachman A and Janiak A (2004). Scheduling jobs with positiondependent processing times. J Opl Res Soc 55: 257-264.
2. Badiru AB (1992). Computational survey of univariate and multivariate learning curve models. IEEE T Eng Manage 39: 176-188.
3. Biskup D (1999). Single-machine scheduling with learning considerations. Eur J Opl Res 115: 173-178.
4. Biskup D (2008). A state-of-the-art review on scheduling with learning effects. Eur J Opl Res 188: 315-329.
5. Cheng TCE and Wang G (2000). Single machine scheduling with learning effect considerations. Ann Opns Res 98: 273-290.
6. Cheng TCE, Wu CC and Lee WC (2008a). Some scheduling problems with sum-of-processing-times-based and job-positionbased learning effects. Inform Sciences 178: 2476-2487.
7. Cheng TCE, Wu CC and Lee WC (2008b). Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 54: 972-982.
8. Eren T (2009). A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Appl Math Model 33: 1141-1150.
9. Eren T and Güner E (2007a). A bicriteria scheduling problem with a learning effect: Total completion time and total tardiness. INFOR: Inform Syst Opl Res 45: 75-81.
10. Eren T and Güner E (2007b). Minimizing total tardiness in a scheduling problem with a learning effect. Appl Math Model 31: 1351-1361.
11. Garey MR and Johnson DS (1979). Computers and Intractability: A Guided Tour to the Theory of NP-Completeness. Freeman: San Francisco.
12. Gonzalez T and Sahni S (1978). Flowshop and jobshop schedules: Complexity and approximation. Opns Res 26: 36-52.
13. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Discrete Math 5: 287-326.
14. Hoogeveen JA and Kawaguchi T (1999). Minimizing total completion time in a two-machine flowshop: Analysis of special cases. Math Opns Res 24: 887-910.
15. Janiak A, Janiak W, Rudek R and Wielgus A (2009). Solution algorithms for the makespan minimization problem with the general learning model. Comput Ind Eng 56: 1301-1308.
16. Johnson SM (1954). Optimal two-and-three-stage production schedules with setup times included. Nav Res Log 1: 61-68.
17. Koulamas C and Kyparisis GJ (2005). Algorithms with performance guarantees for flow shops with regular objective functions. IIE Trans 37: 1107-1111.
18. Koulamas C and Kyparisis GJ (2007). Single-machine and twomachine flowshop scheduling with general learning functions. Eur J Opl Res 178: 402-407.
19. Lee W-C and Wu C-C (2004). Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88: 85-93.
20. Lee W-C, Wu C-C and Sung H-J (2004). A bi-criterion single-machine scheduling problem with learning considerations. Acta Inform 40: 303-315.
21. Mosheiov G (2001a). Scheduling problems with a learning effect. Eur J Opl Res 132: 687-693.
22. Mosheiov G (2001b). Parallel machine scheduling with a learning effect. J Opl Res Soc 52: 1165-1169.
23. Mosheiov G and Sidney JB (2003). Scheduling with general job-dependent learning curves. Eur J Opl Res 147: 665-670.
24. Mosheiov G and Sidney JB (2005). Note on scheduling with general learning curves to minimize the number of tardy jobs. J Opl Res Soc 56: 110-112.
25. Pinedo M (2002). Scheduling: Theory, Algorithms and Systems. Prentice Hall: Englewood Cliffs, NJ.
26. Smith WE (1956). Various optimizers for single-stage production. Nav Res Log 3: 59-66.
27. Smutnicki C (1998). Some results of worst-case analysis for flow shop scheduling. Eur J Opl Res 109: 66-87.
28. Townsend W (1978). The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution. Mngt Sci 24: 530-534.
29. Wang J-B (2005). Flow shop scheduling jobs with positiondependent processing times. J Appl Math Comput 18: 383-391.
30. Wang J-B, Ng CT, Cheng TCE and Liu LL (2008). Single-machine scheduling with a time-dependent learning effect. Int J Prod Econ 111: 802-811.
31. Wang J-B and Xia Z-Q (2005). Flow shop scheduling with a learning effect. J Opl Res Soc 56: 1325-1330.
32. Wright TP (1936). Factors affecting the cost of airplanes. J Aeronaut Sci 3: 122-128.
33. Wu CC and Lee WC (2008). Single-machine scheduling problems with a learning effect. Appl Math Model 32: 1191-1197.
34. Xu Z, Sun L and Gong J (2008). Worst-case analysis for flow shop scheduling with a learning effect. Int J Prod Econ 113: 748-753.