Iterated local search and iterated greedy local search for two machines permutation flowshop scheduling problem with time lag

Autor:	Amdouni Hajer, Ladhari Talel
Rok vydání:	2013
Předmět:	Mathematical optimization Job shop scheduling Iterative method Iterated local search Best-first search Flow shop scheduling Dynamic priority scheduling Greedy algorithm Greedy randomized adaptive search procedure Mathematics
Zdroj:	2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO).
Popis:	In this work, an iterated local search (ILS) and an iterated greedy local search (IGRLS) are proposed for minimizing total completion time in two machines permutation flowshop scheduling problem subject to time lag constraints. Computational experiments carried out on four sets of randomly generated instances reveal that the involvement of the new priority rule improve iterated local search and iterated greedy local search procedures.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b8fe5755bef142c9e5ed8b448eceb2b1 https://doi.org/10.1109/icmsao.2013.6552659 Zobrazit plný text záznamu