Sign in
Back
Iterated local search and iterated greedy local search for two machines permutation flowshop scheduling problem with time lag
Conference proceeding

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

Amdouni Hajer, Ladhari Talel and IEEE
2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), pp.1-4
04/2013
DOI: https://doi.org/10.1109/ICMSAO.2013.6552659

Abstract

Algorithm design and analysis Delays Educational institutions Job shop scheduling Operations research Processor scheduling Search problems
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.

Metrics

1 Record Views

Details