Earliness and Tardiness Minimizing on a Realistic Hybrid Flowshop Scheduling with Learning Effect by Advanced Metaheuristic

Arabian Journal for Science and Engineering

Volumn 38, Issue 5, 2013, Pages 1229-1242

  Behnamian, J ^a   Zandieh, M ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Earliness tardiness; Hybrid flowshops; Hybrid metaheuristic; Position dependent learning effect; Sequence dependent setup times

Indexed keywords

EID: 84876449087     PISSN: 2193567X     EISSN: 21914281     Source Type: Journal    
DOI: 10.1007/s13369-012-0347-6     Document Type: Article

References (59)

1. Linn R., Zhang W.: Hybrid flowshop scheduling: a survey. Comput. Ind. Eng. 37(1), 57-61 (1999).
2. Mosheiov G., Sidney J.: Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147, 665-670 (2003).
3. Mosheiov G.: Parallel machine scheduling with a learning effect. J. Oper. Res. Soc. 52, 1165-1169 (2001).
4. Wright T. P.: Factors affecting the cost of airplanes. J. Aeronaut. Sci. 3, 122-128 (1936).
5. Yelle L. E.: The learning curve: historical review and comprehensive survey. Decis. Sci. 10, 302-328 (1979).
6. Biskup D.: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188, 315-329 (2008).
7. Janiak, A.; et al.: Solution algorithms for the makespan minimization problem with the general learning model. Comput. Ind. Eng. (2008). doi: 10. 1016/j. cie. 2008. 07. 019.
8. Janiak A., Rudek R.: A new approach to the learning effect: beyond the learning curve restrictions. Comput. Oper. Res. 35, 3727-3736 (2008).
9. Kuo W.-H., Yang D.-L.: Parallel-machine scheduling with time dependent processing times. Theor. Comput. Sci. 393, 204-210 (2008).
10. M'Hallah R.: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput. Oper. Res. 34, 3126-3142 (2007).
11. Lauff V., Werner F.: Scheduling with common due date. Earliness and tardiness penalties for multimachine problems: a survey. Math. Comput. Model. 40, 637-656 (2004).
12. Baker, K. R.: Elements of Sequencing and Scheduling. Kenneth R. Baker, Hanover (1994).
13. Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs (1995).
14. Kuo W. H., Yang D.-L.: Single machine scheduling with past-sequence-dependent setup times and learning effects. Inf. Process. Lett. 102, 22-26 (2007).
15. Kurz M. E., Askin R. G.: Comparing scheduling rules for flexible flow lines. Int. J. Prod. Econ. 85, 371-388 (2003).
16. Kim S. C., Bobrowski P. M.: Impact of sequence-dependent setup time on job shop scheduling performance. Int. J. Prod. Res. 32(7), 1503-1520 (1994).
17. Uzsoy R., Lee C.-Y., Martin-Vega L. A.: A review of production planning and scheduling models in the semiconductor industry-part I: system characteristics, performance evaluation and production planning. IIE Trans. 24(4), 47-60 (1992).
18. Quadt D., Kuhn H.: A taxonomy of flexible flow line scheduling procedures. Eur. J. Oper. Res. 178, 686-698 (2007).
19. Allahverdi A., Ng C. T., Cheng T. C. E., Kovalyov M. Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187, 985-1032 (2008).
20. Moursli O., Pochet Y.: A branch-and-bound algorithm for the hybrid flowshop. Int. J. Prod. Econ. 64, 113-125 (2000).
21. Yang Y., Kreipl S., Pinedo M.: Heuristics for minimizing total weighted tardiness in flexible flowshops. J. Sched. 3, 71-88 (2000).
22. Soewnadi H., Elmaghraby S. E.: Sequencing three-stage flexible flowshops with identical machines to minimize makespan. IIE Trans. 33(11), 985-993 (2001).
23. Azizoglu M., Cakmak E., Kondakci S.: A flexible flowshop problem with total flow time minimization. Eur. J. Oper. Res. 132, 528-538 (2001).
24. Sawik T. J.: Mixed integer programming for scheduling flexible flowlines with limited intermediate buffers. Math. Comput. Model. 31(5), 39-52 (2000).
25. Sawik T. J.: Scheduling flexible flow lines with no in-process buffers. Int. J. Prod. Res. 33(2), 1357-1367 (1995).
26. Sawik T. J.: A scheduling algorithm for flexible flow lines with limited intermediate buffers. Appl. Stochas. Models Data Anal. 9(2), 127-138 (1993).
27. Sawik T. J.: An exact approach for batch scheduling in flexible flow line with limited buffers. Math. Comput. Model. 36, 461-471 (2002).
28. Lin H. T., Liao C. J.: A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int. J. Prod. Econ. 86, 133-143 (2003).
29. Engin O., Doyen A.: A new approach to solve hybrid flowshop scheduling problems by artificial immune system. Future Gener. Comput. Syst. 20, 1083-1095 (2004).
30. Allaoui H., Artiba A.: Integrating simulation and optimization to schedule a hybrid flowshop with maintenance constraints. Comput. Ind. Eng. 47, 431-450 (2004).
31. Wardono B., Fathi Y.: A tabu search algorithm for the multi-stage parallel machine problems with limited buffer capacities. Eur. J. Oper. Res. 155, 380-401 (2004).
32. Bertel S., Billaut J. C.: A genetic algorithm for an industrial multiprocessor flowshop scheduling problem with recirculation. Eur. J. Oper. Res. 159(3), 651-662 (2004).
33. Andres C. et al.: Group technology in a hybrid flowshop environment: a case study. Eur. J. Oper. Res. 167, 272-281 (2005).
34. Tang L. X., Xuan H., Liu J.: A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Comput. Oper. Res. 33, 3344-3359 (2006).
35. Janiak A., Kozan E., Lichtenstein M., Oguz C.: Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion. Int. J. Prod. Econ. 105, 407-424 (2007).
36. Alayki{dotless}ran K., Engin O., Döyen A.: Using ant colony optimization to solve hybrid flowshop scheduling problems. Int. J. Adv. Manuf. Technol. 35(5-6), 541-550 (2007).
37. Choi H.-S., Lee D.-H.: A branch and bound algorithm for two-stage hybrid flow shops: minimizing the number of tardy jobs. J. Korean Inst. Ind. Eng. 33, 213-220 (2007).
38. Kim, Y.-D.; Joo, B.-J.; Shin, J.-H.: Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J. Heuristics (2008). doi: 10. 1007/s10732-007-9061-z.
39. Zhu Z., Heady R. B.: Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Comput. Ind. Eng. 38, 297-305 (2000).
40. Liu C. Y., Chang S. C.: Scheduling flexible flowshops with sequence-dependent setup effects. IEEE Trans. Robot. Autom. 16, 408-419 (2000).
41. Botta-Genoulaz V.: Hybrid flowshop scheduling with precedence constraints and time lags to minimize maximum lateness. Int. J. Prod. Econ. 64(1-3), 101-111 (2000).
42. Harjunkoski I., Grossmann I. E.: Decomposition techniques for multistage scheduling problems using mixed integer and constraint programming methods. Comput. Chem. Eng. 26(11), 1533-1552 (2002).
43. Kurz M. E., Askin R. G.: Scheduling flexible flow lines with sequence-dependent setup times. Eur. J. Oper. Res. 159, 66-82 (2004).
44. Pugazhendhi S., Thiagarajan S., Rajendran C., Anantharaman N.: Generating non-permutation schedules in flowline based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach. Int. J. Adv. Manuf. Technol. 23, 64-78 (2004).
45. Jungwattanaki, J.; Reodecha, M.; Chaovalitwongse, P.; Werner, F.: An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat Magdeburg, preprint 28/05, pp. 1-23 (2005).
46. Zandieh M., Fatemi Ghomi S. M. T., Moattar Husseini S. M.: An immune algorithm approach to hybrid flowshops scheduling with sequence-dependent setup times. Appl. Math. Comput. 180, 111-127 (2006).
47. Behnamian J., Zandieh M., Fatemi Ghomi S. M. T.: Due windows group scheduling using an effective hybrid optimization approach. Int. J. Adv. Manuf. Technol. 46, 721-735 (2009).
48. Gholami, M.; Zandieh, M.; Alem-Tabriz, A.: Scheduling hybrid flowshop with sequence-dependent setup times and machines with random breakdowns. Int. J. Adv. Manuf. Technol. (2008). doi: 10. 1007/s00170-008-1577-3.
49. Naderi, B.; Zandieh, M.; Roshanaei, V.: Scheduling hybrid flowshops with sequence-dependent setup times to minimize makespan and maximum tardiness. Int. J. Adv. Manuf. Technol. (2008). doi: 10. 1007/s00170-008-1569-3.
50. Behnamian J., Fatemi Ghomi S. M. T., Zandieh M.: A multi-phase covering pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst. Appl. 36(3), 11057-11069 (2009).
51. Su, L. H.: Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system. Comput. Oper. Res. (2008). doi: 10. 1016/j. cor. 2007. 09. 013.
52. Rios-Mercado R. Z., Bard J. F.: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comput. Oper. Res. 25(2), 351-366 (1998).
53. Kennedy, J.; Eberhart, R. C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. IV, pp. 1942-1948. IEEE Service Center, Piscataway (1995).
54. Kashan, A. H.; Karimi, B.: A discrete particle swarm optimization algorithm for scheduling parallel machines. Comput. Ind. Eng. (2008). doi: 10. 1016/j. cie. 2008. 05. 007.
55. Hansen P., Mladenovic N., Dragan U.: Variable neighborhood search for the maximum clique. Discrete Appl. Math. 145(1), 117-125 (2004).
56. Behnamian J., Zandieh M., Fatemi Ghomi S. M. T.: Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert Syst. Appl. 36(6), 9637-9644 (2009).
57. Leon V. J., Ramamoorthy B.: An adaptable problem-space based search method for flexible flow line scheduling. IIE Trans. 29, 115-126 (1997).
58. Eiben A. E., Hinterding R., Michalewicz Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3(2), 124-141 (1999).
59. Montgomery D. C.: Design and Analysis of Experiments, 5th edn. Wiley, NY (2000).