A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems

Computers and Operations Research

Volumn 38, Issue 8, 2011, Pages 1219-1236

  Dubois Lacoste, Jrmie ^a   Lpez Ibez, Manuel ^a   Sttzle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Flowshop; Hybrid; Multi objective; Scheduling

Indexed keywords

COMPLETION TIME; EXPERIMENTAL ANALYSIS; EXPERIMENTAL COMPARISON; FLOW SHOP PROBLEMS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; HYBRID; HYBRID ALGORITHMS; LOCAL SEARCH; MAKESPAN; MULTI OBJECTIVE; PAIR-WISE COMBINATIONS; PARETO-OPTIMALITY; PERMUTATION FLOW-SHOP SCHEDULING; SEARCH METHOD; STATE-OF-THE-ART ALGORITHMS; TOTAL TARDINESS;

SCHEDULING ALGORITHMS;

MULTIOBJECTIVE OPTIMIZATION;

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

References (41)

1. R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2 2005 479 494
2. C.J. Liao, C.T. Tseng, and P. Luarn A discrete version of particle swarm optimization for flowshop scheduling problems Computers & Operations Research 34 10 2007 3099 3111
3. 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 2 2004 426 438
4. 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 1 2009 84 92
5. E. Vallada, R. Ruiz, and G. Minella Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics Computers & Operations Research 35 4 2008 1350 1373
6. J. Du, and J.Y.T. Leung Minimizing total tardiness on one machine is NP-hard Mathematics of Operations Research 15 3 1990 483 495
7. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 117 129
8. H.H. Hoos, and T. Sttzle Stochastic local search: foundations and applications 2005 Morgan Kaufmann Publishers San Francisco, CA
9. M. Ehrgott, and X. Gandibleux Approximative solution methods for combinatorial multicriteria optimization TOP 12 1 2004 1 88
10. L. Paquete, and T. Sttzle Stochastic local search algorithms for multiobjective combinatorial optimization: a review T.F. Gonzalez, Handbook of approximation algorithms and metaheuristics 2007 Chapman & Hall, CRC 29-1 29-15
11. G. Minella, R. Ruiz, and M. Ciavotta A review and evaluation of multiobjective algorithms for the flowshop scheduling problem INFORMS Journal on Computing 20 3 2008 451 471
12. T.K. Varadharajan, and C. Rajendran A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs European Journal of Operational Research 167 3 2005 772 795
13. J.E. Arroyo, and V.A. Armentano Genetic local search for multi-objective flowshop scheduling problems European Journal of Operational Research 167 3 2005 717 738
14. L. Paquete, and T. Sttzle A two-phase local search for the biobjective traveling salesman problem C.M. Fonseca, Proceedings of EMO 2003. Lecture notes in computer science vol. 2632 2003 Springer Heidelberg, Germany 479 493
15. L. Paquete, M. Chiarandini, and T. Sttzle Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study X. Gandibleux, Metaheuristics for multiobjective optimisation. Lecture notes in economics and mathematical systems vol. 535 2004 Springer 177 200
16. T. Lust, and J. Teghem Two-phase Pareto local search for the biobjective traveling salesman problem Journal of Heuristics. 16 3 2010 475 510
17. R. Ruiz, and T. Sttzle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 3 2007 2033 2049
18. E. Zitzler, L. Thiele, M. Laumanns, C.M. Fonseca, and V. Grunert da Fonseca Performance assessment of multiobjective optimizers: an analysis and review IEEE Transactions on Evolutionary Computation 7 2 2003 117 132
19. J. Dubois-Lacoste, M. Lpez-Ibez, and T. Sttzle Adaptive "anytime" two-phase local search Learning and intelligent optimization, 4th international conference, LION 4. Lecture notes in computer science vol. 6073 2010 Springer Heidelberg, Germany 52 67
20. L. Paquete, T. Schiavinotto, and T. Sttzle On local optima in multiobjective combinatorial optimization problems Annals of Operations Research 156 2007 83 98
21. Paquete L. Stochastic local search algorithms for multiobjective combinatorial optimization: methods and analysis. PhD thesis, FG Intellektik, FB Informatik, TU Darmstadt, Germany; 2005.
22. L. Paquete, and T. Sttzle Design and analysis of stochastic local search for the multiobjective traveling salesman problem Computers & Operations Research 36 9 2009 2619 2631
23. M. Nawaz, E. Enscore Jr., and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem OMEGA 11 1 1983 91 95
24. .D. Taillard Some efficient heuristic methods for the flow shop sequencing problem European Journal of Operational Research 47 1 1990 65 74
25. Dubois-Lacoste J. A study of Pareto and two-phase local search algorithms for biobjective permutation flowshop scheduling. Master's thesis, IRIDIA, Universit Libre de Bruxelles; Brussels, Belgium; 2009.
26. J. Dubois-Lacoste, M. Lpez-Ibez, and T. Sttzle Effective hybrid stochastic local search algorithms for biobjective permutation flowshop scheduling Hybrid metaheuristics6th international workshop, HM 2009. Lecture notes in computer science vol. 5818 2009 Springer Heidelberg, Germany 100 114
27. H. Woo, and D. Yim A heuristic algorithm for mean flowtime objective in flowshop scheduling Computers & Operations Research 25 3 1998 175 182
28. P. Balaprakash, M. Birattari, and T. Sttzle Improvement strategies for the F-race algorithm: sampling design and iterative refinement T. Bartz-Beielstein, M.J. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, HM 2007. Lecture notes in computer science vol. 4771 2007 Springer Heidelberg, Germany 108 122
29. Dubois-Lacoste J, López-Ibez M, Sttzle T. Supplementary material: a hybrid TPPLS algorithm for bi-objective flow-shop scheduling problems. 〈 http://iridia.ulb.ac.be/supp/IridiaSupp2010-001 〉, 2010.
30. C.M. Fonseca, L. Paquete, and M. Lpez-Ibez An improved dimension-sweep algorithm for the hypervolume indicator IEEE congress on evolutionary computation 2006 IEEE Press 1157 1163
31. V. Grunert da Fonseca, C.M. Fonseca, and A.O. Hall Inferential performance assessment of stochastic optimisers and the attainment function E. Zitzler, K. Deb, L. Thiele, C.A. Coello, D. Corne, Proceedings of EMO 2001. Lecture notes in computer science vol. 1993 2001 Springer Heidelberg, Germany 213 225
32. M. Lpez-Ibez, L. Paquete, and T. Sttzle Exploratory analysis of stochastic local search algorithms in biobjective optimization T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss, Experimental methods for the analysis of optimization algorithms 2010 Springer 209 233
33. S. Zilberstein Using anytime algorithms in intelligent systems AI Magazine 17 3 1996 73 83
34. Y.P. Aneja, and K.P.K. Nair Bicriteria transportation problem Management Science 25 1 1979 73 78
35. .D. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 2 1993 278 285
36. C. Rajendran Heuristic algorithm for scheduling in a flowshop to minimize total flowtime International Journal of Production Economics 29 1 1993 65 73
37. J.E. Arroyo, and V.A. Armentano A partial enumeration heuristic for multi-objective flowshop scheduling problems Journal of the Operational Research Society 55 9 2004 1000 1007
38. F. Glover A template for scatter search and path relinking Artificial evolution. Lecture notes in computer science 1998 Springer Heidelberg, Germany 1 51
39. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan A fast and elitist multi-objective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation 6 2 2002 181 197
40. M.T. Jensen Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms IEEE Transactions on Evolutionary Computation 7 5 2003 503 515
41. J.N. Morse Reducing the size of the nondominated set: pruning by clustering Computers & Operations Research 7 12 1980 55 66