An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure

Advances in Engineering Software

Volumn 55, Issue , 2013, Pages 10-31

  Li, Xiangtao ^a   Yin, Minghao ^a,b  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b JILIN UNIVERSITY   (China)

Author keywords

Differential evolution; Diversity measure; Local search; Memetic algorithm; Opposition based search; Permutation flow shop scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; GLOBAL OPTIMIZATION; MACHINE SHOP PRACTICE; OPTIMAL SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS;

DIFFERENTIAL EVOLUTION; DIVERSITY MEASURE; LOCAL SEARCH; MEMETIC ALGORITHMS; OPPOSITION BASED SEARCH; PERMUTATION FLOW-SHOP SCHEDULING;

EVOLUTIONARY ALGORITHMS;

EID: 84867753124     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2012.09.003     Document Type: Article

References (62)

1. H. Stadtler Supply chain management and advanced planning basics, overview and challenges Eur J Oper Res 163 2005 575 588
2. M.R. Garey, and D.S. Johnson Computers and intractability: a guide to the theory of NP-completeness 1979 Freeman San Francisco, CA
3. A.H.G. Rinnooy Kan Machine scheduling problems: classification, complexity, and computations 1976 Nijhoff The Hague
4. S.M. Johnson Optimal two- and three-stage production schedules Naval Res Logis Quart 1 1954 61 68
5. S.P. Bansal Minimizing the sum of completion times of n-jobs over M-machines in a flowshop - a branch and bound approach AIIE Trans 9 1977 306 311
6. F.D. Croce, V. Narayan, and R. Tadei The two-machine total completion time flow shop problem Eur J Oper Res 90 1996 227 237
7. F.D. Croce, M. Ghirardi, and R. Tadei An improved branch-and-bound algorithm for the two machine total completion time flow shop problem Eur J Oper Res 139 2002 293 301
8. E. Ignall, and L. Schrage Application of the branch and bound technique to some flowshop scheduling problem Oper Res 13 1965 400 412
9. E.F. Stafford On the development of a mixed integer linear programming model for the flowshop sequencing problem J Oper Res Soc 39 1988 1163 1174
10. B. Liu, and L. Wang An effective PSO-based memetic algorithm for flow shop scheduling IEEE Trans Syst Man Cyber - Part B 37 2007 18 27
11. M.S. Nagano, and J.V. Moccellin A high quality solution constructive heuristic for flow shop sequencing J Oper Res Soc 53 12 2002 1374 1379
12. P.J. Kalczynski, and J. Kamburowski On no-wait and no-idle flow shops with makespan criterion Eur J Oper Res 178 3 2007 677 685
13. M.S. Nagano, and J.V. Moccellin Reducing mean flow time in permutation flow shop J Oper Res Soc 59 7 2008 939 945
14. H.G. Campbell, R.A. Dudek, and M.L. Smith A heuristic algorithm for the n job, m machine sequencing problem Manage Sci 16 1970 630 637
15. C. Rajendran Heuristic algorithm for scheduling in a flowshop to minimize total flowtime Int J Prod Econ 29 1993 65 73
16. M. Nawaz, E.E. Enscore Jr, and I. Ham A heuristic algorithm for the m-machine, n-job flow shop sequencing problem OMEGA 11 1983 91 95
17. E. Taillard Some efficient heuristic methods for the flowshop sequencing problems Eur JOper Res 47 1990 65 74
18. J.M. Framinan, and R. Leisten An efficient constructive heuristic for flowtime minimization in permutation flow shops OMEGA 31 2003 311 317
19. max flowshop problem Comput Oper Res 17 1990 243 253
20. I. Osman, and C. Potts Simulated annealing for permutation flow shop scheduling OMEGA 17 1989 551 557
21. C. Reeves A genetic algorithm for flowshop sequencing Comput Oper Res 22 1995 5 13
22. C. Reeves, and T. Yamada Genetic algorithms, path relinking and the flowshop sequencing problem Evolut Comput 6 1998 45 60
23. J.J. Liang, Q.K. Pan, T.J. Chen, and L. Wang Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer Int J Adv Manuf Technol 55 5-8 2011 755 762
24. M.F. Tasgetiren, Y.C. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem Eur J Oper Res 177 2007 1930 1947
25. Q.K. Pan, L. Wang, L. Gao, and J.Q. Li An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem Int J Adv Manuf Technol 52 5-8 2011 699 713
26. T. Stützle An ant approach to the flowshop problem Proceedings of the 6th European congress on intelligent techniques and soft computing (EUFIT'98) 1998 Verlag Mainz Aachen, Germany 1560 1564
27. J. Grabowski, and M. Wodecki A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion Comput Oper Res 31 2004 1891 1909
28. E. Nowicki, and C. Smutnicki A fast tabu search algorithm for the permutation flowshop problem Eur J Oper Res 91 1996 160 175
29. Q.-K. Pan, M.F. Tasgetiren, P.N. Suganthan, and T.J. Chua A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem Inform Sci 181 12 2011 2455 2468
30. M.F. Tasgetiren, P.N. Suganthan, and Quan-Ke Pan An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem Appl Math Comput 215 2010 3356 3368
31. Stützle T. Applying iterated local search to the permutation flowshop problem. Technical report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intellectics Group, Darmstad, Germany; 1998.
32. J. Bassem, and M. Eddaly An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Comput Oper Res 36 2009 2638 2646
33. A.C. Nearchou A novel metaheuristic approach for the flow shop scheduling problem Eng Appl Artif Intell 17 2004 289 300
34. L.Y. Tseng, and Y.T. Lin A hybrid genetic local search algorithm for the permutation flowshop scheduling problem Eur J Oper Res 198 2009 84 92
35. Y. zhang, X.P. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization Eur J Oper Res 196 2009 869 876
36. L. Wang, and D.Z. Zheng An effective hybrid heuristic for flow shop scheduling Int J Adv Manuf Technol 21 2003 38 44
37. T. Murata, H. Ishibuchi, and H. Tanaka Genetic algorithms for flowshop scheduling problems Comput Oper Res 30 1996 1061 1071
38. L. Dipak, and Uday K. Chakraborty An efficient stochastic hybrid heuristic for flowshop scheduling Eng Appl Artif Intell 20 2007 851 856
39. X.Y. Dong, and H.K. Huang An iterated local search algorithm for the permutation flowshop problem with total flowshop criterion Comput Oper Res 36 2009 1664 1669
40. M.F. Tasgetiren, Y.C. Liang, M. Sevkli, and G. Gencyilmaz Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem Proceedings of the fourth international symposium on intelligent manufacturing systems 2004 Sakarya Turkey 431 441
41. T.M. Zheng, and M.S. Yamashiro Solving flow shop scheduling problems by quantum differential evolutionary algorithm Int J Adv Manuf Technol 49 2010 5 8
42. M.F. Tasgetiren, Y.C. Liang, M. Sevkli, and G. Gencyilmaz Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion Proceedings of the 4th international symposium on intelligent manufacturing systems (IMS 2004) 2004 Sakarya Turkey 442 452
43. G. Onwubolu, and D. Davendra Scheduling flow shops using differential evolution algorithm Eur J Oper Res 171 2006 674 692
44. B. Qian, and L. Wang A hybrid differential evolution method for permutation flow-shop scheduling Int J Adv Manuf Technol 38 2008 757 777
45. R. Storn, and K. Price Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces J Glob Optim 11 1997 341 359
46. S. Dasgupta, S. Das, and A. Biswas On stability and convergence of the population-dynamic in differential evolution AI Commun 22 2009 1 20
47. Ursem RK. Diversity-guided evolutionary algorithms. In: Proceedings of parallel problem solving form nature conference - PPSN VII, Granada, Spain; 2002. p. 462-71.
48. Ursem RK. Models for evolutionary algorithms and their applications in system identification and control optimization. PhD thesis, Department of Computer Science, University of Aarhus, Aarhus, Denmark; 2003.
49. Riget J, Vesterstroem JS. A diversity-guided particle swarm optimizer-the ARPSO. Technical report 2002-02, EVA Life, Department of Computer Science, University of Aarhus; 2002. p. 1-13.
50. L. dos Santos Coelho, R. Clemente, T. Souza Viviana, and Cocco Mariani Improved differential evolution approach based on cultural algorithm and diversity measure applied to solve economic load dispatch problems Math Comput Simul 79 2009 3136 3147
51. S. Rahnamayan, H.R. Tizhoosh, and M.M.A. Salama Opposition-based differential evolution algorithms IEEE congress on evolutionary computation 2006 Vancouver BC, Canada
52. S. Rahnamayan, H.R. Tizhoosh, and M.M.A. Salama Opposition-based differential evolution for optimization of noisy problems IEEE congress on evolutionary computation 2006 Vancouver BC Canada
53. E. Nowicki, and C. Smutnicki A fast tabu search algorithm for the permutation flow-shop problem Eur J Oper Res 91 1996 160 175
54. J. Carlier Ordonnancements a contraintes disjonctives RAIRO Recher Oper/Oper 12 1978 333 351
55. E. Taillard Benchmarks for basic scheduling problems Eur J Oper Res 64 1993 278 285
56. E. Demirkol, S. Mehta, and R. Uzsoy Benchmarks for shop scheduling problems Eur J Oper Res 109 1998 137 141
57. L. Wang, H. Wu, F. Tang, and D.Z. Zheng A hybrid quantum inspired genetic algorithm for flow shop scheduling Lect Notes Comput Sci 3645 2005 636 644
58. C. Zhang, and J. Sun An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem Expert Syst Appl 36 2009 5162 5167
59. J.D. Zhang, and C.S. Zhang The circular discrete particle swarm optimization algorithm for flow shop scheduling problem Expert Syst Appl 37 2010 5827 5834
60. C.Y. Low, J.Y. Yeh, and K.I. Huang A robust simulated annealing heuristic for flow shop scheduling problems Int J Adv Manuf Technol 23 2004 762 767
61. C.-J. Liao, C.-T. Tseng, and P. Luarn A discrete version of particle swarm optimization for flowshop scheduling problems Comput Oper Res 10 2007 3099 3111
62. M.F. Tasgetiren, Y.C. Liang, M. Sevkli, and G. Gencyilmaz Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem Proceedings of the fourth international symposium on intelligent manufacturing systems 2004 Sakarya Turkey 431 441