A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem

作者：Vilcot Geoffrey^*; Billaut Jean Charles

来源：International Journal of Production Research, 2011, 49(23): 6963-6980.

DOI：10.1080/00207543.2010.526016

• scheduling
• jobshop
• tabu search
• multi-objective

The problem that we consider in this article is a flexible job shop scheduling problem issued from the printing and boarding industry. Two criteria have to be minimised, the makespan and the maximum lateness. Two tabu search algorithms are proposed for finding a set of non-dominated solutions: the first is based on the minimisation of one criterion subject to a bound on the second criterion (epsilon-constraint approach) and the second is based on the minimisation of a linear combination of criteria. These algorithms are tested on benchmark instances from the literature and the results are discussed. The total tardiness is considered as a third criterion for the second tabu search and results are presented and discussed.

• 出版日期2011