An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness

Expert Systems with Applications

Volumn 36, Issue 6, 2009, Pages 9625-9633

  Naderi, B ^a   Zandieh, M ^b   Khaleghi Ghoshe Balagh, A ^c   Roshanaei, V ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

^c IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Hybrid flowshop; Hybrid simulated annealing; Local search; Scheduling; Sequence dependent setup times; Total completion time; Total tardiness; Transportation time

Indexed keywords

HYBRID FLOWSHOP; HYBRID SIMULATED ANNEALING; LOCAL SEARCH; SEQUENCE-DEPENDENT SETUP TIMES; TOTAL COMPLETION TIME; TOTAL TARDINESS; TRANSPORTATION TIME;

ANNEALING; SCHEDULING; TAGUCHI METHODS;

SIMULATED ANNEALING;

EID: 64449085610     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2008.09.063     Document Type: Article

References (40)

1. Adenso-Di{dotless}́az B. An SA/TS mixture algorithm for the scheduling tardiness problem. European Journal of Operational Research 88 (1996) 516-524
2. Al-Aomar R. Incorporating robustness into genetic algorithm search of stochastic simulation outputs. Simulation Modelling Practice and Theory 14 (2006) 201-223
3. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov Y.M. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187 3 (2008) 985-1032
4. Baker K.R. Introduction to sequence and scheduling (1974), Wiley, NY
5. Bïrbïl I., and Fang S.C. An electromagnetism-like mechanism for global optimization. Journal of global optimization 25 (2003) 263-282
6. Caprihan R., and Wadhwa S. Scheduling of FMSs with information delays: A simulation study. International Journal of Flexible Manufacturing System 17 (2005) 39-65
7. Cheng B.W., and Chang C.L. A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm. Expert Systems with Applications 32 (2007) 415-421
8. Cochran W.G., and Cox G.M. Experimental designs. 2nd ed. (1992), Wiley, NY
9. Conway R.W., and Maxwell W.L. Theory of scheduling (1967), Addison-Wesley, MA
10. Gupta J.N.D. Two-stage hybrid flowshop scheduling problem. Journal of the Operational Research Society 39 4 (1988) 359-364
11. Gupta J.N.D., and Darrow W.P. The two-machine sequence dependent flowshop scheduling problem. European Journal of Operational Research 24 3 (1986) 439-446
12. Jarboui B., Ibrahi S., Siarry P., and Rebai A. A combinatorial particle swarm optimization for solving permutation flowshop problems. Computers and Industrial Engineering 54 (2008) 526-538
13. Jin Z., Yang Z., and Ito T. Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem. International Journal of Production Economics 100 (2006) 322-334
14. Johnson S.M. Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-67
15. Kim Y.D. Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of Operational Research Society 44 (1993) 19-28
16. Kim Y.D., Lim H.G., and Park M.W. Search heuristics for a flowshop scheduling problem in a pronted circuit board assembly process. European Journal of Operational Research 91 (1996) 124-143
17. Kolon M. Some new results on simulated annealing applied to the job shop scheduling problem. European Journal of Operational Research 113 (1999) 123-136
18. Kurz M.E., and Askin R.G. Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85 (2003) 371-388
19. Kurz M.E., and Askin R.G. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159 1 (2004) 66-82
20. Luh P.B., Gou L., Zhang Y., Nagahora T., Tsuji M., Yoneda K., et al. Job shop scheduling with group dependent setups, finite buffers, and long time horizon. Annual of Operation Research 76 (1998) 233-259
21. Lundy M., and Mees A. Convergence of an annealing algorithm. Mathematical Programming 34 (1986) 111-124
22. Luo, F., Sun, H., Geng, T., & Qi, N. (xxxx). Application of Taguchi's method in the optimization of bridging efficiency between confluent and fresh microcarriers in bead-to-bead transfer of Vero cells. Biotechnology Letter. doi:10.1007/s10529-007-9604-2.
23. Montgomery D.C. Design and analysis of experiments. 5th ed. (2000), John Wiley & Sons, NY
24. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 (1983) 91-95
25. Ng E.Y.K., and Kee Ng E.W. Parametric study of the biopotential equation for breast tumour identification using ANOVA and Taguchi method. International Federation for Medical and Biological Engineering 44 (2006) 131-139
26. Norman B.A., and Bean J.C. A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics 46 (1999) 199-211
27. Parthasarathy S., and Rajendran C. A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence dependent setup times of jobs - A case study. Production Planning and Control 8 (1997) 475-483
28. Phadke M.S. Quality engineering using robust design (1989), Prentice-Hall, USA
29. Ross R.J. Taguchi techniques for quality engineering (1989), McGraw-Hill, USA
30. Ruiz R., and Allahverdi A. Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. Annals of Operation Research 156 (2007) 143-171
31. Ruiz R., and Maroto C. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169 (2006) 781-800
32. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34 (2006) 461-476
33. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 (2007) 2033-2049
34. Ruiz R., and Stützle T. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187 3 (2008) 1143-1159
35. Sule D.R. Industrial scheduling (1997), PWS Publishing Company, NJ
36. Tsai J.T., Ho W.H., Liu T.K., and Chou J.H. Improved immune algorithm for global numerical optimization and job shop scheduling problems. Applied Mathematics and Computation 194 (2007) 406-424
37. Vallada E., Ruiz R., and Minella G. Minimizing total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers and Operations Research 35 4 (2008) 1350-1373
38. Wang L., and Zheng D.Z. An effective hybrid optimization strategy for job-shop scheduling problems. Computers and Operations Research 28 (2001) 585-596
39. Yoshida T., and Hitomi K. Optimal two-stage production with setup times separated. AIIE Transactions 11 (1979) 261-263
40. Zandieh M., Fatemi Ghomi S.M.T., and Moattar Husseini S.M. An immune algorithm approach to hybrid flowshops scheduling with sequence dependent setup times. Journal of Applied Mathematics and Computation 180 (2006) 111-127