Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem

International Journal of Advanced Manufacturing Technology

Volumn 62, Issue 1-4, 2012, Pages 249-265

  Defersha, Fantahun Melaku ^a   Chen, Mingyuan ^b  

^a UNIVERSITY OF GUELPH   (Canada)

^b Dept of Electrical and Computer Engineering   (Canada)

Author keywords

Genetic algorithm; Hybrid flexible flowshop; Lot streaming; Parallel computing

Indexed keywords

COMPUTATIONAL PERFORMANCE; FLEXIBLE FLOWSHOP; FLOW-SHOPS; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; LOT STREAMING; MAKESPAN; MULTI-STAGE; MULTI-STAGE MANUFACTURING SYSTEMS; NUMERICAL EXAMPLE; PARALLEL COMPUTING PLATFORM; PARALLEL GENETIC ALGORITHMS; PARALLEL IMPLEMENTATIONS; RESEARCH EFFORTS; UNRELATED PARALLEL MACHINES;

GENETIC ALGORITHMS; MANUFACTURE; MATHEMATICAL MODELS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS; STREAM FLOW;

PROBLEM SOLVING;

EID: 84865353852     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3798-0     Document Type: Article

References (39)

1. K Baker 1995 Lot streaming in the two-machine flow shop with setup times Annal Oper Res 57 1 1 11 0831.90070 10.1007/BF02099687
2. KR Baker D Jia 1993 A comparative study of lot streaming procedures OMEGA Int J Manag Sci 21 5 561 566 10.1016/0305-0483(93)90024-F
3. S Bertel JC Billaut 2004 A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation Eur J Oper Res 159 3 651 662 2078861 1065.90032 10.1016/S0377-2217(03)00434-X
4. D Biskup M Feldmann 2006 Lot streaming with variable sublots: an integer programming formulation J Oper Res Soc 57 3 296 303 1089.90038 10.1057/palgrave.jors.2602016
5. Blackburn J (1991) Time-based competition. Business One Irwin, Burr Ridge
6. Bockerstette J, Shell R (1993) Time based manufacturing. McGraw-Hill, New York
7. V Botta-Genoulaz 2000 Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness Int J Prod Econ 64 1-3 101 111 10.1016/S0925-5273(99)00048-1 (Pubitemid 30557647)
8. J Bukchin M Masin 2004 Multi-objective lot splitting for a single product m-machine flowshop line IIE Trans 36 2 191 202 10.1080/07408170490245487
9. Cantú-Paz E (2000) Efficient and accurate parallel genetic algorithms. Kluwer Academic, Norwell
10. JH Chang HN Chiu 2005 A comprehensive review of lot streaming Int J Prod Res 43 8 1515 1536 10.1080/00207540412331325396 (Pubitemid 41633046)
11. J Chen G Steiner 1996 Lot streaming with detached setups in three-machine flow shops Eur J Oper Res 96 3 591 611 10.1016/S0377-2217(96)00091-4 (Pubitemid 127378192)
12. HN Chiu JH Chang CH Lee 2004 Lot streaming models with a limited number of capacitated transporters in multistage batch production systems Comput Oper Res 31 12 2003 2020 1100.90507 10.1016/S0305-0548(03)00159-X (Pubitemid 38728565)
13. FM Defersha M Chen 2007 A parallel genetic algorithm for dynamic cell formation in cellular manufacturing systems Int J Prod Res 10.1080/ 00207540701441962
14. M Feldmann D Biskup 2008 Lot streaming in a multiple product permutation flow shop with intermingling Int J Prod Res 46 1 197 216 1128.90369 10.1080/00207540600930065 (Pubitemid 350129547)
15. C Glass G JND C Potts 1994 Lot streaming in three-stage process Eur J Oper Res 75 2 378 394 0824.90079 10.1016/0377-2217(94)90082-5
16. NG Hall G Laporte E Selvarajah C Srikandarajah 2003 Scheduling and lot streaming in flow shops with no-wait in process J Sched 6 4 339 354 1992431 1027.90031 10.1023/A:1024042209719
17. A Janiak E Kozan M Lichtenstein C Oǧuzc 2007 Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion Int J Prod Econ 105 2 407 424 10.1016/j.ijpe.2004.05.027 (Pubitemid 44827610)
18. J Jungwattanakit M Reodecha P Chaovalitwongse F Werner 2008 Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria Int J Adv Manuf Technol 37 3-4 354 370 10.1007/s00170-007- 0977-0 (Pubitemid 351571819)
19. S Kumar T Bagchi C Sriskandarajah 2000 Lot streaming and scheduling heuristics for m-machine no-wait flow shop Comput Ind Eng 38 1 149 172 10.1016/S0360-8352(00)00035-8
20. SC Liu 2003 A heuristic method for discrete lot streaming with variable sublots in a flow shop Int J Adv Manuf Technol 22 9-10 662 668 10.1007/s00170-002-1516-7
21. S Marimuthu SG Ponnambalam AN Jawahar 2008 Evolutionary algorithms for scheduling m-machine flow shop with lot streaming Robot Comput-Integr Manuf 24 1 125 139 10.1016/j.rcim.2006.06.007 (Pubitemid 47532342)
22. CH Martin 2009 A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming OMEGA Int J Manag Sci 37 1 126 137 10.1016/j.omega.2006.11.002
23. C Oǧuz Y Zinder VH Do A Janiak M Lichtenstein 2004 Hybrid flow-shop scheduling problems with multiprocessor task systems Eur J Oper Res 152 1 115 131 1044.90036 10.1016/S0377-2217(02)00644-6
24. C Oǧuz ME Frinket 2005 A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks J Sched 8 4 323 351 2149893 10.1007/s10951-005-1640-y (Pubitemid 40878783)
25. C Potts K Baker 1989 Flow shop scheduling with lot streaming Oper Res Lett 8 6 297 303 1035182 0682.90051 10.1016/0167-6377(89)90013-8 (Pubitemid 20667535)
26. S Reiter 1966 A system for managing job shop production J Bus 39 3 371 393 10.1086/294867
27. R Ruiz FS Şerifoglub T Urlings 2008 Modeling realistic hybrid flexible flowshop scheduling problems Comput Oper Res 5 4 1151 1175 10.1016/j.cor.2006.07.014 (Pubitemid 47404765)
28. R Ruiz C Maroto 2006 A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility Eur J Oper Res 169 3 781 800 2173993 1079.90061 10.1016/j.ejor.2004.06.038 (Pubitemid 41492016)
29. A Sen E Topaloglu OS Benli 1998 Optimal streaming of a single job in a two-stage flow shop Eur J Oper Res 110 1 42 62 0936.90027 10.1016/S0377-2217(98) 00203-3 (Pubitemid 128401883)
30. C Sriskandarajah E Wagneur 1999 Lot streaming and scheduling multiple products in two-machine no-wait flow shop IIE Trans 31 8 695 707 (Pubitemid 30499398)
31. L Tang W Liu J Liu 2005 A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment J Intell Manuf 16 3 361 370 10.1007/s10845-005-7029-0 (Pubitemid 40878763)
32. L Tang H Xuan J Liu 2006 A new lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time Comput Oper Res 33 11 3344 3359 1113.90064 10.1016/j.cor.2005.03.028 (Pubitemid 43333229)
33. D Trietsch K Baker 1993 Basic techniques for lot streaming Oper Res 41 6 1065 1076 0791.90026 10.1287/opre.41.6.1065
34. CT Tseng CJ Liao 2008 A discrete particle swarm optimization for lot-streaming flowshop scheduling problem Eur J Oper Res. 199 2 360 373 10.1016/j.ejor.2007.08.030 (Pubitemid 351698067)
35. RG Vickson BE Alfredsson 1992 Two and three machines flow shop scheduling problems with equal sized transfer batches Int J Prod Res 30 7 1551 1574 0825.90542 10.1080/00207549208948107
36. Xiao W, Hao P, Zhang S, Xu X (2000) Hybrid flow shop scheduling using genetic algorithms. Proceeding of the 3rd World Congress on Intelligent Control and Automation. Hefei, P.R. China pp 537-541
37. K-C Ying S-W Lin 2006 Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach Int J Prod Res 44 16 3161 3177 1159.90409 10.1080/00207540500536939 (Pubitemid 43898318)
38. M Zandieh SMT Fatemi Ghomi SM Moattar Husseini 2006 An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times Appl Math Comput 180 1 111 127 2263370 1102.90029 10.1016/j.amc.2005.11.136 (Pubitemid 44331328)
39. W Zhang C Yin J Liu RJ Linn 2005 Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops Int J Prod Econ. 96 2 189 200 10.1016/j.ijpe.2004.04.005 (Pubitemid 40200699)