Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 24, Issue 4, Pages 741-754Publisher
SPRINGER
DOI: 10.1007/s10845-011-0622-5
Keywords
Scheduling; Tabu search; Setup times; Lateness minimization; Computational experiments
Funding
- Spanish Ministry of Science and Education [MEC-FEDER TIN2010-20976-C02-02]
- Principality of Asturias [FICYT-BP07-109]
Ask authors/readers for more resources
We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search algorithm. To assess the performance of this algorithm, we present the results of an extensive experimental study, including an analysis of the tabu search algorithm under different running conditions and a comparison with the state-of-the-art algorithms. The experiments are performed across two sets of conventional benchmarks with 960 and 17 instances respectively. The results demonstrate that the proposed tabu search algorithm is superior to the state-of-the-art methods both in quality and stability. In particular, our algorithm establishes new best solutions for 817 of the 960 instances of the first set and reaches the best known solutions in 16 of the 17 instances of the second set.
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