Minimizing makespan in a two-machine no-wait flow shop with batch processing machines

International Journal of Advanced Manufacturing Technology

Volumn 63, Issue 1-4, 2012, Pages 281-290

  Muthuswamy, Shanthi ^a   Vélez Gallego, Mario C ^b   Maya, Jairo ^b   Rojas Santiago, Miguel ^c  

^a NORTHERN ILLINOIS UNIVERSITY   (United States)

^b UNIVERSIDAD EAFIT   (Colombia)

^c UNIVERSIDAD DEL NORTE   (Colombia)

Author keywords

Batch processing machines; Makespan; No wait flow shop; Particle swarm optimization

Indexed keywords

BATCH PROCESSING MACHINE; COMMERCIAL SOLVERS; EXPERIMENTAL STUDIES; FLOW-SHOPS; JOB SIZE; LARGE-SCALE PROBLEM; MAKESPAN; MATHEMATICAL FORMULATION; MINIMIZING MAKESPAN; NO-WAIT; NO-WAIT FLOW SHOP; NP-HARD; PARTICLE SWARM OPTIMIZATION ALGORITHM; PROCESSING TIME; RUNTIMES; SOLUTION QUALITY; TWO MACHINES;

PARTICLE SWARM OPTIMIZATION (PSO);

SCHEDULING ALGORITHMS;

EID: 84867811634     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-012-3906-9     Document Type: Article

References (22)

1. Oulamara A (2007) Makespan minimization in a no-wait flow shop problem with two batching machines. Comput Oper Res 34(4):1033-1050
2. Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655-679
3. Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510-525
4. Framinan J, Nagano M (2008) Evaluating the performance for makespan minimisation in no-wait flowshop sequencing. J Mater Process Technol 197(1-3):1-9
5. Laha D, Chakraborty UK (2008) A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. Int J Adv Manuf Technol 41(1-2):97-109
6. Laha D, Chakraborty UK (2009) An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling. Int J Adv Manuf Technol 44:559-569
7. Xiaoping L, Qian W, Cheng W (2008) Heuristic for no-wait flow shops with makespan minimization. Int J Prod Res 46(9):2519-2530
8. Pan Q-K, Wang L, Zhao B-H (2008) An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol 38(7-8):778-786
9. Ruiz R, Allahverdi A (2009) New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness. Int J Prod Res 47(20):5717-5738
10. Chihaoui FB, Kacem I, Hadj-Alouane AB, Dridi N, Rezg N (2011) No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates. Int J Prod Res 49(21):6273-6286
11. Glass CA, Potts CN, Strusevich VA (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS J Comput 13(2):120-137
12. Potts CN, Strusevich VA, Tautenhahn T (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. J Sched 4(1):25-51
13. Soukhal A, Oulamara A, Martineau P (2005) Complexity of flow shop scheduling problems with transportation constraints. Eur J Oper Res 161(1):32-41
14. Lin BMT, Cheng TCE (2005) Two-machine flowshop batching and scheduling. Ann Oper Res 133(1-4):149-161
15. Ahmadi JH, Ahmadi RH, Dasu S, Tang CS (1992) Batching and scheduling jobs on batch and discrete processors. Oper Res 40(4):750-763
16. Jolai F, Kor H, Hatefi SM, Iranmanesh H (2009) A genetic algorithm for makespan minimization in a no-wait flow shop problem with two batching machines. Comp Eng Technol Int Conf 2:238-242
17. Lian Z, Jiao B, Gu X (2006) A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Appl Math Comput 183(2):1008-1017
18. Pan Q-K, Tasgetiren MF, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807-2839
19. Tseng C-T, Liao C-J (2008) A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. Eur J Oper Res 191(2):360-373
20. Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56(4):1309-1318
21. Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part I: background and development. Nat Comput 6(4):467-484
22. Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7(1):109-124