A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

Computers and Operations Research

Volumn 40, Issue 2, 2013, Pages 627-632

  Dong, Xingye ^a,c   Chen, Ping ^b   Huang, Houkuan ^a   Nowak, MacIek ^c  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b NANKAI UNIVERSITY   (China)

^c LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

Iterated local search; Metaheuristic; Permutation flow shop; Scheduling; Total flow time

Indexed keywords

ITERATED LOCAL SEARCH; LOCAL OPTIMA; META HEURISTICS; METAHEURISTIC; PERMUTATION FLOW SHOPS; SEARCH SPACES; STATE OF THE ART; TOTAL FLOWTIME;

BENCHMARKING; SCHEDULING;

HEURISTIC ALGORITHMS;

EID: 84867398630     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.08.021     Document Type: Article

References (31)

1. S. Johnson Optimal two and three-stage production schedule with setup times included Naval Research Logistics Quarterly 1 1 1954 61 68
2. ci scheduling problem European Journal of Operational Research 132 2001 439 452
3. 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
4. M. Garey, D. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 117 129
5. E. Ignall, and L. Schrage Application of the branch and bound technique to some flow-shop scheduling problems Operations Research 13 1965 400 412
6. E. Stafford On the development of a mixed integer linear programming model for the flowshop sequencing problem Journal of the Operational Research Society 39 1988 1163 1174
7. S. van de Velde Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation Annals of Operations Research 26 1990 257 268
8. F. Croce, V. Narayan, and R. Tadei The two-machine total completion time flow shop problem European Journal of Operational Research 90 1996 227 237
9. F. Croce, M. Ghirardi, and R. Tadei An improved branch-and-bound algorithm for the two machine total completion time flow shop problem European Journal of Operational Research 139 2002 293 301
10. C. Chung, J. Flynn, and O. Kirca A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems International Journal of Production Economics 79 2002 185 196
11. J. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristic for flowtime minimisation in permutation flowshops Computers & Operations Research 32 2005 1237 1254
12. X. Li, and C. Wu An efficient constructive heuristic for permutation flow shops to minimize total flowtime Chinese Journal of Electronics 14 2 2005 203 208
13. X. Li, Q. Wang, and C. Wu Efficient composite heuristics for total flowtime minimization in permutation flowshops Omega 37 2009 155 164
14. D. Laha, and S. Sarin A heuristic to minimize total flowtime in permutation flowshop Omega 37 2009 734 739
15. 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
16. C. Rajendran, and H. Ziegler Two ant-colony algorithms for minimizing total flowtime in permutation flowshops Computers and Industrial Engineering 48 2005 789 797
17. 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
18. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285
19. 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 3 2009 869 876
20. 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
21. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers & Operations Research 36 2009 2638 2646
22. 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
23. 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
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. 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
26. O. Martin, S. Otto, and E. Felten Large-step Markov chains for the traveling salesman problem Complex Systems 5 3 1991 299 326
27. O. Martin, and S. Otto Combining simulated annealing with local search heuristics Annals of Operations Research 63 1996 57 75
28. H. Lourenco Job-shop scheduling computational study of local search and large-step optimization methods European Journal of Operational Research 83 1995 347 364
29. Stützle T. Applying iterated local search to the permutation flow shop problem. Technical Report, AIDA-98-04, FG Intellektik, TU Darmstadt; 1998.
30. P. Chen, H. Huang, and X. Dong Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem Expert Systems with Applications 37 2010 1620 1627
31. M. Pinedo Scheduling Theory, Algorithms, and Systems 2nd edition 2001 Prentice Hall