Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness
Author:
- 4 February 2013
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 51 (12) , 3476-3487
Abstract
This paper studies the problem of scheduling flexible job shops with setup times where the setups are sequence-dependent. The objective is to find the schedule with minimum total tardiness. First, the paper develops a mathematical model in the form of mixed integer linear programming and compares it with the available model in the literature. The proposed model outperforms the available model in terms of both size complexity and computational complexity. Then, an effective metaheuristic algorithm based on iterated local search is proposed and compared with a tabu search and variable neighbourhood search algorithms proposed previously for the same problem. A complete experiment is conducted to evaluate the algorithms for performance. All the results show the superiority of the proposed algorithm against the available ones.Keywords
This publication has 24 references indexed in Scilit:
- Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic AlgorithmExpert Systems with Applications, 2012
- Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approachJournal of Manufacturing Systems, 2011
- Parallel hybrid metaheuristics for the flexible job shop problemComputers & Industrial Engineering, 2010
- An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problemEuropean Journal of Operational Research, 2010
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problemInternational Journal of Production Research, 2009
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problemsComputers & Operations Research, 2008
- A survey of scheduling problems with setup times or costsEuropean Journal of Operational Research, 2008
- Mathematical modeling and heuristic approaches to flexible job shop scheduling problemsJournal of Intelligent Manufacturing, 2007
- Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problemsJournal of Intelligent Manufacturing, 2004
- Job-shop scheduling with multi-purpose machinesComputing, 1990