Abstract
In this paper we confront the weighted tardiness minimization in the job shop scheduling problem with sequence-dependent setup times. We start by extending an existing disjunctive graph model used for makespan minimization to represent the weighted tardiness problem. Using this representation, we adapt a local search neighborhood originally defined for makespan minimization. The proposed neighborhood structure is used in a genetic algorithm hybridized with a simple tabu search method. This algorithm is quite competitive with state-of-the-art methods in solving problem instances from several datasets of both classical JSP and JSP with setup times.
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
Artigues, C., Lopez, P., Ayache, P.D.: 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)
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)
Essafi, I., Mati, Y., Dauzère-Pérès, S.: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers and Operations Research 35, 2599–2616 (2008)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers (1997)
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, M.A., Vela, C., 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), pp. 116–123. AAAI Press, Sidney (2008)
Mati, Y., Dauzere-Peres, S., Lahlou, C.: A general approach for optimizing regular criteria in the job-shop scheduling problem. European Journal of Operational Research (2011), doi:10.1016/j.ejor.2011.01.046
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)
Singer, M., Pinedo, M.: A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions 30, 109–118 (1998)
Sun, X., Noble, J.: An approach to job shop scheduling with sequence-dependent setups. Journal of Manufacturing Systems 18(6), 416–430 (1999)
Taillard, E.: Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6, 108–117 (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, 139–165 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, M.A., Vela, C.R., Varela, R. (2011). Weighted Tardiness Minimization in Job Shops with Setup Times by Hybrid Genetic Algorithm. In: Lozano, J.A., Gámez, J.A., Moreno, J.A. (eds) Advances in Artificial Intelligence. CAEPIA 2011. Lecture Notes in Computer Science(), vol 7023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25274-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-25274-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25273-0
Online ISBN: 978-3-642-25274-7
eBook Packages: Computer ScienceComputer Science (R0)