Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues

Autor
Juan, Á.; Lourenço, H.; Mateo, M.; Luo, R.; Castella, Q.
Tipus d'activitat
Article en revista
Revista
International transactions in operational research
Data de publicació
2014-01
Volum
21
Número
1
Pàgina inicial
103
Pàgina final
126
DOI
https://doi.org/10.1111/itor.12028 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/21449 Obrir en finestra nova
URL
http://onlinelibrary.wiley.com/doi/10.1111/itor.12028/pdf Obrir en finestra nova
Resum
Iterated local search (ILS) is a powerful framework for developing efficient algorithms for the permutation flow-shop problem (PFSP). These algorithms are relatively simple to implement and use very few parameters, which facilitates the associated fine-tuning process. Therefore, they constitute an attractive solution for real- life applications. In this paper, we discuss some parallelization, parametrization, and randomization issues related to ILS-based algorithms for solving the PFSP. In parti...
Citació
Juan-Pérez, A. [et al.]. Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues. "International transactions in operational research", Gener 2014, vol. 21, núm. 1, p. 103-126.
Paraules clau
Biased randomized heuristics, Flow-shop problem, Iterated local search, Metaheuristics, Parallelizable algorithms, Parameters setting, Scheduling
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants

  • Juan Pérez, Ángel Alejandro  (autor)
  • Lourenço, Helena R.  (autor)
  • Mateo Doll, Manuel  (autor)
  • Luo, Rachel  (autor)
  • Castellà, Quim  (autor)