Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop

Abstract

An Iterated Local Search (ILS) is used to minimize total tardiness in the Flexible Job Shop. New priority rules associated with list scheduling algorithms that exploit characteristics of the problem are proposed. The ILS uses a larger neighborhood than the literature reference. Computational tests using a new set of 600 instances show that the proposed priority rules outperform the literature rules. Moreover the proposed ILS has a better performance than the literature reference metaheuristc