Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers

International Journal of Advanced Manufacturing Technology

Volumn 58, Issue 1-4, 2012, Pages 309-325

  Abyaneh, Sina Hakimzadeh ^a   Zandieh, M ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Bi objective optimization; Hybrid flow shop scheduling; Limited buffer space; Sequence dependent setup times

Indexed keywords

BI-OBJECTIVE OPTIMIZATION; HYBRID FLOW SHOP PROBLEM; HYBRID FLOW SHOP SCHEDULING; LIMITED BUFFERS; MAKESPAN; META-HEURISTIC APPROACH; NON-DOMINATED SORTING GENETIC ALGORITHMS; NP-HARD; SEQUENCE-DEPENDENT SETUP TIME; TOTAL TARDINESS;

GENETIC ALGORITHMS; MACHINE SHOP PRACTICE; OPTIMIZATION; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 84855645015     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3368-5     Document Type: Article

References (26)

1. Abadi INK, Hall NG, Sriskandarajah C (2000) Minimizing cycle time in a blocking flowshop. Oper Res 48:177-180
2. Behnamian J, Fatemi Ghomi SMT, Zandieh M (2009) A multiphase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst Appl 36:11057-11069
3. Caraffa V, Ianes S, Bagchi TP, Sriskandarajah C (2001) Minimizing makespan in a flowshop using genetic algorithms. Int J Prod Econ 70:101-115 (Pubitemid 32264325)
4. Chang P-C, Chen S-H (2009) The development of a subpopulation genetic algorithm II (SPGA II) for multi-objective combinatorial problems. Appl Soft Comput 9:173-181
5. Davoudpour H, Ashrafi M (2009) Solving multi-objective SDST flexible flow shop using GRASP algorithm. Int J Adv Manuf Technol 44 (7-8) : 737-747. doi:10.1007/s00170-008-1887-5
6. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm (NSGA-II). IEEE Trans Evol Comput 6:2
7. Hung TSL, Ching JL (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86:133-143
8. Jolai F, Sheikh Sh, Rabbani M, Karimi M (2009) A genetic algorithm for solving no-wait flexible flow lines with due windows, and job rejection. Int J Adv Manuf Technol 42 (5-6) : 523-532
9. Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85:371-388
10. Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159(1) : 66-82
11. Leisten R (1990) Flowshop sequencing problems with limited buffer storage. Int J Prod Res 28:2085-2100
12. Luh PB, Gou L, Zhang Y, Nagahora T, Tsuji M, Yoneda K, Hasegawa T, Kyoya Y, Kano T (1998) Job shop scheduling with group dependent setups, finite buffers, and long time horizon. Ann Oper Res 76:233-259 (Pubitemid 128405205)
13. McCormick ST, Pinedo ML, Shenker S, Wolf B (1989) Sequencing in an assembly line with blocking to minimize cycle time. Oper Res 37:925-936
14. Norman BA (1999) Scheduling flowshops with finite buffers and sequence-dependent setup times. Comput Ind Eng 36:163-177
15. Nowicki E (1999) The permutation flow shop with buffers: a tabu search approach. Eur J Oper Res 116:205-219
16. Pinedo M (1995) Scheduling theory, algorithms, and systems, 2nd edn. Prentice-Hall, Englewood Cliffs
17. Ronconi DP (2004) A note on constructive heuristics for the flowshop problem with blocking. Int J Prod Econ 87:39-48
18. Ronconi DP, Henriques LRS (2007) Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 37:272-281
19. Sawik TJ (1993) A scheduling algorithm for flexible flow lines with limited intermediate buffers. Appl Stoch Models Data Anal 9:127-138
20. Sawik TJ (1995) Scheduling flexible flow lines with no in-process buffers. Int J Prod Res 33(5) : 1357-1367
21. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278-285 (Pubitemid 23599340)
22. Wang L, Zhang L, Zheng D-Z (2006) An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput Oper Res 33:2960-2971 (Pubitemid 43199834)
23. Wardono B, Fathi Y (2004) A tabu search algorithm for the multistage parallel machine problem with limited buffer capacities. Eur J Oper Res 155:380-401
24. Wittrock RJ (1988) An adaptable scheduling algorithm for flexible flow lines. Oper Res 36:445-453
25. Yaurima V, Burtseva L, Tchernykh A (2008) Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comput Ind Eng. doi:10.1016/j.cie.2008.09.004
26. Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180:111-127 (Pubitemid 44331328)