Abstract
We face the Job Shop Scheduling Problem with Sequence Dependent Setup Times and maximum lateness minimization as objective function. We propose a disjunctive graph representation for this problem that allows to define the concept of critical path properly. From this representation, we have defined a neighborhood structure suitable to cope with lateness minimization. This neighborhood structure is exploited in combination with a Tabu Search algorithm. We report results from an experimental study across conventional benchmark instances showing that this approach outperforms some of the current state-of-the-art methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Managament Science 34, 391–401 (1988)
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)
Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with setup times, deadlines and precedence constraints. Journal of Scheduling 11, 253–262 (2008)
Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck fo job shop scheduling. Management Science 44(2), 262–275 (1998)
Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49, 107–127 (1994)
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)
Carlier, J., Pinson, E.: Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 78, 146–161 (1994)
Dell’ Amico, M., Trubian, M.: Applying tabu search to the job-shop scheduling problem. Annals of Operational Research 41, 231–252 (1993)
Glover, F.: Tabu search–part I. ORSA Journal on Computing 1(3), 190–206 (1989)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
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, M.A., Vela, C.R., Varela, R.: 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.) IWINAC 2009. LNCS, vol. 5601, pp. 265–274. Springer, Heidelberg (2009)
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 Int. Conf. on Fuzzy Systems, FUZZ-IEEE 2007, pp. 692–697 (2007)
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)
Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. Journal of Scheduling 8, 145–159 (2005)
Ovacik, I., Uzsoy, R.: Exploiting shop floor status information to schedule complex job shops. Journal of Manufacturing Systems 13(2), 73–84 (1994)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Van Laarhoven, P., Aarts, E., Lenstra, K.: Job shop scheduling by simulated annealing. Operations Research 40, 113–125 (1992)
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 16(2), 139–165 (2010), doi:10.1007/s10732-008-9094-y
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, M.A., Vela, C.R., Varela, R. (2010). A Tabu Search Algorithm to Minimize Lateness in Scheduling Problems with Setup Times. In: Meseguer, P., Mandow, L., Gasca, R.M. (eds) Current Topics in Artificial Intelligence. CAEPIA 2009. Lecture Notes in Computer Science(), vol 5988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14264-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-14264-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14263-5
Online ISBN: 978-3-642-14264-2
eBook Packages: Computer ScienceComputer Science (R0)