Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem

Computers and Industrial Engineering

Volumn 87, Issue , 2015, Pages 176-185

  Dong, Xingye ^a   Nowak, Maciek ^b   Chen, Ping ^c   Lin, Youfang ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b LOYOLA UNIVERSITY CHICAGO   (United States)

^c NANKAI UNIVERSITY   (China)

Author keywords

Multi neighborhood search; Permutation flow shop; Scheduling; Self adaptive perturbation; Total flow time

Indexed keywords

ALGORITHMS; BENCHMARKING; COMBINATORIAL OPTIMIZATION; LOCAL SEARCH (OPTIMIZATION); MACHINE SHOP PRACTICE; PERTURBATION TECHNIQUES; PROBLEM SOLVING; SCHEDULING;

COMBINATORIAL OPTIMIZATION PROBLEMS; FLOW SHOP SCHEDULING PROBLEM; NEIGHBORHOOD SEARCH; PERMUTATION FLOW SHOPS; SELF-ADAPTIVE PERTURBATION; STATE-OF-THE-ART ALGORITHMS; TOTAL FLOWTIME; VARIABLE NEIGHBORHOOD SEARCH;

OPTIMIZATION;

EID: 84930205094     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2015.04.030     Document Type: Article

References (28)

1. R. Battiti, M. Brunato, and F. Mascia Reactive search and intelligent optimization Vol. 45 2008 Springer Science & Business Media
2. W. Costa, M. Goldbarg, and E. Goldbard Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime Expert Systems with Applications 39 2012 13118 13126
3. W. Costa, M. Goldbarg, and E. Goldbard New VNS heuristic for total flowtime flowshop scheduling problem Expert Systems with Applications 39 2012 8149 8161
4. X. Dong, P. Chen, H. Huang, and M. Nowak A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time Computers & Operations Research 40 2013 627 632
5. X. Dong, H. Huang, and P. Chen An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion Computers & Operations Research 36 2009 1664 1669
6. J. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristic for flowtime minimisation in permutation flowshops Computers & Operations Research 32 2005 1237 1254
7. M. Garey, D. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 117 129
8. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distributation algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers & Operations Research 36 2009 2638 2646
9. S. Johnson Optimal two and three-stage production schedule with setup times included Naval Research Logistics Quarterly 1 1954 61 68
10. D. Laha, and S. Sarin A heuristic to minimize total flowtime in permutation flowshop Omega 37 2009 734 739
11. J. Liu, and C. Reeves Constructive and composite heuristic solutions to the p / / ci scheduling problem European Journal of Operational Research 132 2001 439 452
12. X. Li, Q. Wang, and C. Wu Efficient composite heuristics for total flowtime minimization in permutation flowshops OMEGA 37 2009 155 164
13. X. Li, and C. Wu An efficient constructive heuristic for permutation flow shops to minimize total flowtime Chinese Journal of Electronics 14 2005 203 208
14. H. Lourenço, O. Martin, and T. Stützle Handbook of metaheuristics Iterated local search: Framework and applications Vol. 146 2010 Springer US 363 397 International series in operations research & management science
15. Q.-K. Pan, and R. Ruiz Local search methods for the flowshop scheduling problem with flowtime minimization European Journal of Operational Research 222 2012 31 43
16. Q.-K. Pan, M. Tasgetiren, and Y.-C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers and Industrial Engineering 55 2008 795 816
17. M. Pinedo Scheduling: Theory, algorithms, and systems 2nd ed. 2001 Prentice Hall
18. C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2004 426 438
19. C. Rajendran, and H. Ziegler Two ant-colony algorithms for minimizing total flowtime in permutation flowshops Computers and Industrial Engineering 48 2005 789 797
20. C.R. Reeves Handbook of metaheuristics Genetic algorithms Vol. 146 2010 Springer US 109 139 International Series in Operations Research & Management Science
21. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 2007 2033 2049
22. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285
23. M. 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 European Journal of Operational Research 177 2007 1930 1947
24. M. Tasgetiren, Q.-K. Pan, P. Suganthan, and A.H.-L. Chen A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops Information Sciences 181 2011 3459 3475
25. L.-Y. Tseng, and Y.-T. Lin A hybrid genetic local search algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 198 2009 84 92
26. L.-Y. Tseng, and Y.-T. Lin A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem International Journal of Production Economics 127 2010 121 128
27. X. Xu, Z. Xu, and X. Gu An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization Expert Systems with Applications 38 2011 7970 7979
28. Y. Zhang, X. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 196 2009 869 876