Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 265, Issue 2, Pages 503-516Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2017.08.021
Keywords
Scheduling; Flexible job shop; Tabu search; Sequence-dependent setup times
Ask authors/readers for more resources
This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times and where the objective is to minimize the makespan. We first present a mathematical model which can solve small instances to optimality, and also serves as a problem representation. After studying structural properties of the problem using a disjunctive graph model, we develop a tabu search algorithm with specific neighborhood functions and a diversification structure. Extensive experiments are conducted on benchmark instances. Test results first show that our algorithm outperforms most existing approaches for the classical flexible job shop scheduling problem. Additional experiments also confirm the significant improvement achieved by integrating the propositions introduced in this study. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available