An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem

International Journal of Advanced Manufacturing Technology

Volumn 52, Issue 5-8, 2011, Pages 699-713

  Pan, Quan Ke ^a   Wang, Ling ^b   Gao, Liang ^c   Li, Junqing ^a  

^a LIAOCHENG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Flow shop scheduling; Lot streaming; Makespan; Shuffled frog leaping algorithm; Speed up evaluation

Indexed keywords

FLOW-SHOP SCHEDULING; LOT-STREAMING; MAKESPAN; SHUFFLED FROG-LEAPING ALGORITHMS; SPEED-UP EVALUATION;

COMPUTATIONAL EFFICIENCY; MACHINE SHOP PRACTICE; SCHEDULING ALGORITHMS;

MATHEMATICAL OPERATORS;

EID: 79751527709     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-2775-3     Document Type: Article

References (33)

1. S Marimuthu SG Ponnambalam N Jawahar 2008 Evolutionary algorithms for scheduling m-machine flow shop with lot streaming Robot Comput Integr Manuf 24 125 139 10.1016/j.rcim.2006.06.007 (Pubitemid 47532342)
2. S Marimuthu SG Ponnambalam N Jawahar 2009 Threshold accepting and ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming J Mater Process Technol 209 1026 1041 10.1016/j.jmatprotec.2008.03.013
3. SH Yoon JA Ventura 2002 An application of genetic algorithms to lot-streaming flow shop scheduling IIE Trans 34 779 787 (Pubitemid 34732107)
4. JH Chang HN Chiu 2005 A comprehensive review of lot streaming Int J Prod Res 43 1515 1536 10.1080/00207540412331325396 (Pubitemid 41633046)
5. CT Tseng CJ Liao 2008 A discrete particle swarm optimization for lot-streaming flowshop scheduling problem Eur J Oper Res 191 360 373 1149.90064 10.1016/j.ejor.2007.08.030 (Pubitemid 351698067)
6. KR Baker D Jia 1993 A comparative study of lot streaming procedure Omega 21 561 566 10.1016/0305-0483(93)90024-F
7. D Trietsch KR Baker 1993 Basic techniques for lot streaming Oper Res 41 1065 1076 0791.90026 10.1287/opre.41.6.1065
8. DH Kropp TL Smunt 1990 Optimal and heuristic models for lot splitting in a flow shop Decis Sci 21 691 709 10.1111/j.1540-5915.1990.tb01244.x
9. J Bukchin M Tzur M Jaffer 2002 Lot splitting to minimize average flow-time in a two-machine flow-shop IIE Trans 34 953 970 (Pubitemid 34882638)
10. J Liu 2008 Single-job lot streaming in m-1 two-stage hybrid flowshops Eur J Oper Res 187 3 1171 1183 1137.90506 10.1016/j.ejor.2006.06.066 (Pubitemid 350236630)
11. RS Edis MA Ornek 2009 A tabu search-based heuristic for single-product lot streaming problems in flow shops Int J Adv Manuf Technol 43 1202 1213 10.1007/s00170-008-1798-5
12. RG Vickson BE Alfredsson 1992 Two- and three-machine flow shop scheduling problems with equal size transfer batches Int J Prod Res 30 1551 1574 0825.90542 10.1080/00207549208948107
13. FC Cetinkaya 1994 Lot streaming in a two-stage flow shop with set-up, processing and removal times separated J Oper Res Soc 45 1445 1455 0814.90045
14. RG Vickson 1995 Optimal lot streaming for multiple products in a two-machine flow shop Eur J Oper Res 85 556 575 0912.90183 10.1016/0377-2217(93) E0366-6
15. C Sriskandarajah E Wagneur 1999 Lot streaming and scheduling multiple products in two-machine no-wait flowshops IIE Trans 31 695 707 (Pubitemid 30499398)
16. S Kumar TP Bagchi C Sriskandarajah 2000 Lot streaming and scheduling heuristics for m-machine no-wait flowshops Comput Ind Eng 38 149 172 10.1016/S0360-8352(00)00035-8
17. AA Kalir SC Sarin 2001 A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots Omega 29 577 584 10.1016/S0305-0483(01)00046-9 (Pubitemid 33628772)
18. SH Yoon JA Ventura 2002 Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling Comput Oper Res 29 1301 1315 0994.90063 10.1016/S0305-0548(01)00032-6 1905827 (Pubitemid 34409648)
19. S Marimuthu SG Ponnambalam 2005 Heuristic search algorithms for lot streaming in a two-machine flowshop Int J Adv Manuf Technol 27 174 180 10.1007/s00170-004-2127-2 (Pubitemid 41677219)
20. CH Martin 2009 A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming Omega 37 126 137 10.1016/j.omega.2006.11.002
21. Wang L (2003) Shop scheduling with genetic algorithms. Tsinghua University Press, Beijing
22. E Elbeltagi T Hegazy D Grierson 2005 Comparison among five evolutionary-based optimization algorithms Adv Eng Inform 19 43 53 10.1016/j.aei.2005.01.004 (Pubitemid 41000265)
23. MM Eusuff KE Lansey 2003 Optimization of water distribution network design using the shuffled frog leaping algorithm J Water Resourc Plan Manage 129 210 225 10.1061/(ASCE)0733-9496(2003)129:3(210) (Pubitemid 36562716)
24. M Eusuff K Lansey F Pasha 2006 Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization Eng Optim 38 129 154 10.1080/03052150500384759 2204783 (Pubitemid 43279596)
25. A Rahimi-Vahed AH Mirzaei 2008 Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm Soft Comput 12 435 452 1170.90397 10.1007/s00500-007-0210-y (Pubitemid 350269058)
26. G Chung KE Lansey 2009 Application of the shuffled frog leaping algorithm for the optimization of a general large-scale water supply system J Water Resourc Manage 23 797 823 10.1007/s11269-008-9300-6
27. A Rahimi-Vahed AH Mirzaei 2007 A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem Comput Ind Eng 53 642 666 10.1016/j.cie.2007.06.007 (Pubitemid 47588649)
28. A Rahimi-Vahed M Dangchi H Rafiei E Salimi 2009 A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem Int J Adv Manuf Technol 41 1227 1239 10.1007/s00170-008-1558-6
29. J Grabowski J Pempera 2005 Some local search algorithms for no-wait flow-shop problem with makespan criterion Comput Oper Res 32 2197 2212 1068.90058 10.1016/j.cor.2004.02.009 2122450
30. E Taillard 1990 Some efficient heuristic methods for the flow shop sequencing problems Eur J Oper Res 47 65 74 0702.90043 10.1016/0377-2217(90) 90090-X 1067999 (Pubitemid 20733430)
31. M Nawaz EEJ Enscore I Ham 1983 A heuristic algorithm for the m-machine, n-job flow shop sequencing problem Omega 11 91 95 10.1016/0305-0483(83)90088-9 (Pubitemid 13193807)
32. T Murata H Ishibuchi H Tanaka 1996 Genetic algorithms for flow shop scheduling problems Comput Ind Eng 30 1061 1071 10.1016/0360-8352(96)00053-8 (Pubitemid 126375914)
33. B Qian L Wang DX Huang WL Wang X Wang 2009 An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers Comput Oper Res 36 209 233 1163.90507 10.1016/j.cor.2007.08.007 2577248