Abstract
We face the Job Shop Scheduling Problem with Sequence Dependent Setup Times and makespan minimization. To solve this problem we propose a new approach that combines a Genetic Algorithm with a Tabu Search method. We report results from an experimental study across conventional benchmark instances showing that this hybrid approach outperforms the current state-of-the-art methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with set-up times, deadlines and precedence constraints. Journal of Scheduling (2008), doi:10.1007s10951-008-0067-7
Brucker, P., Thiele, O.: A branch and bound method for the general-job shop problem with sequence-dependent setup times. Operations Research Spektrum 18, 145–161 (1996)
Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49, 107–127 (1994)
Carlier, J., Pinson, E.: Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 78, 146–161 (1994)
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Managament Science 34, 391–401 (1988)
Vela, C.R., Varela, R., González, M.A.: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. Journal of Heuristics (2009), doi:10.1007/s10732-008-9094-y
González, M.A., Vela, C.R., Varela, R.: A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008), Sidney. AAAI Press, Menlo Park (2008)
González Rodríguez, I., Vela, C.R., Puente, J.: A memetic approach to fuzzy job shop based on expectation model. In: Proceedings of IEEE International Conference on Fuzzy Systems, London, pp. 692–697. IEEE, Los Alamitos (2007)
Zhang, C.Y., Li, P., Rao, Y., Guan, Z.: A very fast TS/SA algorithm for the job shop scheduling problem. Computers and Operations Research 35, 282–294 (2008)
Dell’ Amico, M., Trubian, M.: Applying tabu search to the job-shop scheduling problem. Annals of Operational Research 41, 231–252 (1993)
Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. Journal of Scheduling 8, 145–159 (2005)
Glover, F.: Tabu search–part I. ORSA Journal on Computing 1(3), 190–206 (1989)
Artigues, C., Lopez, P., Ayache, P.: Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research 138, 21–52 (2005)
Matsuo, H., Suh, C., Sullivan, R.: A controlled search simulated annealing method for the general jobshop scheduling problem. Working paper 03-44-88, Graduate School of Business, University of Texas (1988)
Van Laarhoven, P., Aarts, E., Lenstra, K.: Job shop scheduling by simulated annealing. Operations Research 40, 113–125 (1992)
Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck fo job shop scheduling. Management Science 44(2), 262–275 (1998)
Bierwirth, C.: A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spectrum 17, 87–92 (1995)
Varela, R., Serrano, D., Sierra, M.: New codification schemas for scheduling with genetic algorithms. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 11–20. Springer, Heidelberg (2005)
Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal of Computing 3, 149–156 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, M.A., Vela, C.R., Varela, R. (2009). Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times. In: Mira, J., Ferrández, J.M., Álvarez, J.R., de la Paz, F., Toledo, F.J. (eds) Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira’s Scientific Legacy. IWINAC 2009. Lecture Notes in Computer Science, vol 5601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02264-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-02264-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02263-0
Online ISBN: 978-3-642-02264-7
eBook Packages: Computer ScienceComputer Science (R0)