Effective hybrid stochastic local search algorithms for biobjective permutation flowshop scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5818 LNCS, Issue , 2009, Pages 100-114

  Dubois Lacoste, Jérémie ^a   López Ibáñez, Manuel ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETION TIME; COMPUTATION TIME; EXPERIMENTAL ANALYSIS; LOCAL SEARCH; LOCAL SEARCH METHOD; MAKESPAN; NONDOMINATED SOLUTIONS; PAIR-WISE COMBINATIONS; PERMUTATION FLOW-SHOP SCHEDULING; SEARCH METHOD; STOCHASTIC LOCAL SEARCHES; TOTAL TARDINESS;

SCHEDULING ALGORITHMS; STOCHASTIC SYSTEMS;

LEARNING ALGORITHMS;

EID: 71049131252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04918-7_8     Document Type: Conference Paper

References (19)

1. Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165, 479-494 (2005)
2. Liao, C.J., Tseng, C.T., Luarn, P.: A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research 34(10), 3099-3111 (2007)
3. Tsenga, L.Y., Lin, Y.T.: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 198(1), 84-92 (2009)
4. Vallada, E., Ruiz, R., Minella, G.: Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research 35(4), 1350-1373 (2008)
5. Minella, G., Ruiz, R., Ciavotta, M.: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing 20(3), 451-471 (2008)
6. Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3), 2033-2049 (2007)
7. Paquete, L., Stützle, T.: A two-phase local search for the biobjective traveling salesman problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.2632, pp. 479-493. Springer, Heidelberg (2003)
8. Paquete, L., Chiarandini, M., Stützle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In: Gandibleux, X., et al. (eds.) Metaheuristics for Multiobjective Optimisation. LNEMS, vol.535, pp. 177-200. Springer, Heidelberg (2004)
9. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 117-132 (2003)
10. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117-129 (1976)
11. Varadharajan, T.K., Rajendran, C.: 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), 772-795 (2005)
12. Paquete, L., Stützle, T.: Stochastic local search algorithms for multiobjective combinatorial optimization: A review. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall/CRC (2007); 29-1-29-115
13. Nawaz, M., Enscore Jr., E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA 11(1), 91-95 (1983)
14. Taillard, E.D.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47(1), 65-74 (1990)
15. Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the FRace algorithm: Sampling design and iterative refinement. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. LNCS, vol.4771, pp. 108-122. Springer, Heidelberg (2007)
16. Taillard, E.D.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64(2), 278-285 (1993)
17. Grunert da Fonseca, V., Fonseca, C.M., Hall, A.: Inferential performance assessment of stochastic optimisers and the attainment function. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol.1993, pp. 213-225. Springer, Heidelberg (2001)
18. Ĺopez-Ib́añez, M., Paquete, L., Stützle, T.: Exploratory analysis of stochastic local search algorithms in biobjective optimization. Technical Report TR/IRIDIA/ 2009-015, IRIDIA, Universit́e Libre de Bruxelles, Brussels, Belgium (May 2009)
19. Lust, T., Teghem, J.: Two-phase Pareto local search for the biobjective traveling salesman problem. Journal of Heuristics (to appear, 2009), doi:10.1007/s10732-009- 9103-9109