New VNS heuristic for total flowtime flowshop scheduling problem

Expert Systems with Applications

Volumn 39, Issue 9, 2012, Pages 8149-8161

  Costa, Wagner Emanoel ^a   Goldbarg, Marco César ^a   Goldbarg, Elizabeth G ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

Author keywords

Flowshop; Heuristics; Scheduling; Total flowtime; VNS

Indexed keywords

COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; DATA SETS; EVOLUTIONARY APPROACH; EXPERIMENTAL STUDIES; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; FLOW-SHOPS; HEURISTICS; HYBRID APPROACH; NOVEL SOLUTIONS; TOTAL FLOWTIME; VARIABLE NEIGHBORHOOD SEARCH; VNS;

STATISTICAL TESTS;

SCHEDULING;

EID: 84858338641     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2012.01.152     Document Type: Article

References (26)

1. W.J. Conover Practical nonparametric statistics 2nd ed. 1980 J. Wiley
2. X. Dong, H. Huang, and P. Chen An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion Computers and Operations Research 36 2009 1664 1669
3. J.M. Framinan, and R. Leisten An efficient constructive heuristic for flowtime minimisation in permutation flow shops Omega 31 2003 311 317
4. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation European Journal of Operational Research 141 2002 559 569
5. R. Graham, E. Lawler, J. Lenstra, and A.R. Kan Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
6. P. Hansen, and N. Mladenović Variable neighborhood search for the p-median Location Science 5 1997 207 226
7. P. Hansen, N. Mladenović, and J.A.M. Pérez Variable neighbourhood search: Methods and applications Operations Research 2008 319 360
8. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers and Operations Research 36 2009 2638 2646
9. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimisation for solving permutation flowshop problems Computers and Industrial Engineering 54 2008 526 538
10. C.-J. Liao, C.-T. Tseng, and P. Luarn A discrete version of particle swarm optimization for flowshop scheduling problems Computers and Operations Research 34 2007 3099 3111
11. ci scheduling problem European Journal of Operational Research 132 2001 439 452
12. T. Murata, H. Ishibuchi, and H. Tanaka Genetic algorithms for flowshop scheduling problems Computers and Industrial Engineering 30 1996 1061 1071
13. M.S. Nagano, and J.V. Moccellin Reducing mean flow time in permutation flow shop Journal of the Operational Research Society 59 2007 1700 1707
14. M.S. Nagano, R. Ruiz, and L.A.N. Lorena A constructive genetic algorithm for permutation flowshop scheduling Computers and Industrial Engineering 55 2008 195 207
15. Q.-K. Pan, M.F. Tasgetiren, and Y.-C. Liang A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem Computers and Operations Research 35 2008 2807 2839
16. C. Rajendran Heuristic algorithm for scheduling in a flowshop to minimize total flowtime International Journal of Production Economics 29 1993 65 73
17. C. Rajendran, and H. Ziegler An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs European Journal of Operational Research 103 1997 129 138
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. R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the flowshop scheduling problem European Journal of Operational Research 177 2007 2033 2049
20. E.D. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285
21. 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 European Journal of Operational Research 177 2007 1930 1947
22. M.F. Tasgetiren, Q.-K. Pan, P.N. Suganthan, and A.H.-L. Chen A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion Proceedings of the IEEE world congress on computational intelligence (WCCI-2010) 2010 IEEE 137 144
23. 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
24. 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
25. Y. Zhang, X. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 169 2009 869 876
26. Y. Zhang, X. Li, Q. Wang, and J. Zhu Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization International Conference on Computer Supported Cooperative Work in Design 2009 IEEE Computer Society Los Alamitos, CA, USA 582 589