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

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.