Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times
- First Online:
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.
KeywordsScheduling Tabu search Setup times Lateness minimization Computational experiments
Unable to display preview. Download preview PDF.
- Beck, J. C., Feng, T., & Watson, J. P. (2010). Combining constraint programming and local search for job-shop scheduling. Informs Journal on Computing. doi:10.1287/ijoc.1100.0388.
- Fleszar, K., Charalambous, C., & Hindi, K. S. (2011). A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. Journal of Intelligent Manufacturing. doi:10.1007/s10845-011-0522-8.
- González, M. A., Vela, C., & Varela, R. (2008). A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS-2008) (pp. 116–123). Sidney: AAAI Press.Google Scholar
- González, M. A., Vela, C. R., & Varela, R. (2009). A Tabu search algorithm to minimize lateness in scheduling problems with setup times. In Proceedings of CAEPIA 2009 (pp. 115–124).Google Scholar
- Grabowski, J., & Wodecki, M. (2005). A very fast Tabu search algorithm for job shop problem. In Metaheuristic optimization via memory and evolution. Operations research/computer science interfaces series, Vol. 30, pp. 117–144.Google Scholar
- Huang, J., Suer, G., & Urs, S. (2011). Genetic algorithm for rotary machine scheduling with dependent processing times. Journal of Intelligent Manufacturing. doi:10.1007/s10845-011-0521-9.
- Matsuo, H., Suh, C., & Sullivan, R. (1988). A controlled search simulated annealing method for the general jobshop scheduling problem. Working paper 03-44-88, Graduate School of Business, University of Texas.Google Scholar
- Meeran, S., & Morshed, M. (2011). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: A case study. Journal of Intelligent Manufacturing. doi:10.1007/s10845-011-0520-x.
- Oddi, A., Rasconi, R., Cesta, A., & Smith, S. (2009). Iterative-sampling search for job shop scheduling with setup times. In COPLAS 2009 Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (pp. 27–33).Google Scholar
- Pinedo M. (2008) Scheduling. Theory, Algorithms, and Systems. Springer, BerlinGoogle Scholar
- Ying, K. C., Lee, Z. J., & Lin, S. W. (2011). Makespan minimization for scheduling unrelated parallel machines with setup times. Journal of Intelligent Manufacturing. doi:10.1007/s10845-010-0483-3.