A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem
Authors:
- 20 January 2011
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 49 (23) , 6963-6980
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- An effective architecture for learning and evolving flexible job-shop schedulesEuropean Journal of Operational Research, 2007
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup timesEuropean Journal of Operational Research, 2006
- A heuristic to schedule flexible job-shop in a glass factoryEuropean Journal of Operational Research, 2005
- Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logicMathematics and Computers in Simulation, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Benchmarks for shop scheduling problemsEuropean Journal of Operational Research, 1998
- Nurse scheduling with tabu search and strategic oscillationEuropean Journal of Operational Research, 1998
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu searchAnnals of Operations Research, 1997
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994
- Tabu Search—Part IINFORMS Journal on Computing, 1989