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

• Published in: International journal of production research Vol. 49; no. 23; pp. 6963 - 6980
• Main Authors: Vilcot, Geoffrey, Billaut, Jean-Charles
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis Group 01.12.2011; Taylor & Francis; Taylor & Francis LLC
• Subjects: Algorithms; Applied sciences; Benchmarking; Boarding; Computer Science; Criteria; Decision theory. Utility theory; Exact sciences and technology; Inventory control, production control. Distribution; Job shop scheduling; Job shops; jobshop; Lateness; multi-objective; Multiple criteria decision making; Operational research and scientific management; Operational research. Management science; Operations Research; Optimization algorithms; Printing; Production scheduling; scheduling; Scheduling, sequencing; Studies; Tabu search; Printing; Production system; Multicriteria analysis; Job shop; Multiobjective programming; Scheduling; Makespan; jobshop; Delay; Search algorithm; Linear combination; Tabu search; Flexible manufacturing system; Lateness; multi-objective; scheduling; tabu search
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/00207543.2010.526016

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 (ε-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.