From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness

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

Volumn 7997 LNCS, Issue , 2013, Pages 321-334

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

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Automatic algorithm configuration; Grammatical evolution; Iterated greedy; Permutation flow shop problem

Indexed keywords

ALGORITHMIC FRAMEWORK; AUTOMATIC ALGORITHMS; AUTOMATIC CONFIGURATION; FLOW SHOP PROBLEMS; GRAMMATICAL EVOLUTION; ITERATED GREEDY; PARAMETRIC REPRESENTATIONS; REPEATED APPLICATION;

COMPUTATIONAL GRAMMARS; HEURISTIC ALGORITHMS; OPTIMIZATION;

PARAMETER ESTIMATION;

EID: 84890904937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-44973-4_36     Document Type: Conference Paper

References (13)

1. Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the F-Race 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.) HCI 2007. LNCS, vol. 4771, pp. 108-122. Springer, Heidelberg (2007)
2. Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Trans. Evol. Comput. 16(7), 406-417 (2012)
3. Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15(3), 483-495 (1990)
4. Dubois-Lacoste, J., López-Ibáñez, M., Stützle, T.: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Comput. Oper. Res. 38(8), 1219-1236 (2011)
5. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117-129 (1976)
6. Johnson, D.S.: Optimal two- and three-stage production scheduling with setup times included. Naval Res. Logistics Quart. 1, 61-68 (1954)
7. KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: automatically building local search SAT solvers from components. In: Boutilier, C. (ed.) Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524. AAAI Press/International Joint Conferences on Artificial Intelligence, Menlo Park (2009)
8. López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Technical report TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Belgium (2011)
9. López-Ibánez, M., Stützle, T.: The automatic design of multi-objective ant colony optimization algorithms. IEEE Trans. Evol. Comput. 16(6), 861-875 (2012)
10. Mckay, R.I., Hoai, N.X., Whigham, P.A., Shan, Y., O'Neill, M.: Grammar-based genetic programming: a survey. Genet. Program. Evolvable Mach. 11(3-4), 365-396 (2010)
11. Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033-2049 (2007)
12. Taillard, É.D.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278-285 (1993)
13. Vázquez-Rodríguez, J.A., Ochoa, G.: On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming. J. Oper. Res. Soc. 62(2), 381-396 (2010)