Abstract
An algorithm of simulated annealing for the job shop scheduling problem is presented. The proposed algorithm restarts with a new value every time the previous algorithm finishes. To begin the process of annealing, the starting point is a randomly generated schedule with the condition that the initial value of the makespan of the schedule does not surpass a previously established upper bound. The experimental results show the importance of using upper bounds in simulated annealing in order to more quickly approach good solutions.
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
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of Flow shop and Job shop Scheduling. Mathematics of Operations Research I(2), 117–129 (1976)
Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)
Balas, E.: Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res. 17, 941–957 (1969)
Kirkpatrick, S., Gelatt Jr., S.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Aarts, E.H.L., Van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.L.J.: A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing 6, 118–125 (1994)
Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Prentice-Hall, U.S.A (1995)
Matsuo, H., Suii, C.J., Sullivan, R.S.: A controlled search simulated annealing method for the general job shop scheduling problem, Working paper 03-04-88, Graduate School of Business, University of Texas, Austin (1988)
Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113–125 (1992)
Yamada, T., Nakano, R.: Job-shop scheduling by simulated annealing combined with deterministic local search, Meta-heuristics: theory and applications, pp. 237–248. Kluwer Academic Publishers, USA (1996)
Yamada, T., Rosen, B.E., Nakano, R.: A simulated annealing approach to job shop scheduling using critical block transition operators. IEEE, Los Alamitos (1994) 0-7803-1901-X/94
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Mgmt. Sci. 34 (1988)
Ingber, L.: Simulated annealing: Practice versus theory. Mathematical Computer Modelling 18(11), 29–57 (1993)
Nakano, R., Yamada, T.: Conventional Genetic Algorithm for Job-Shop. Problems. In: Kenneth, M.K., Booker, L.B. (eds.) Proceedings of the 4th International Conference on Genetic Algorithms and their Applications, San Diego, USA, pp. 474–479 (1991)
Zalzala, P.J., Flemming, Z.A.M.S.(Ali M.S.) (ed.): Genetic algorithms in engineering systems/Edited by A.M.S. Institution of Electrical Engineers, London (1997)
Aydin, M.E., Fogarty, T.C.: Modular Simulated annealing algorithm for job shop scheduling running on distributed resource machin (DRM), South Bank University, SCISM, 103 Borough Road, London, SE1 0AA, UK (2002)
Beasley, J.E.: OR Library, Imperial College, Management School (1990), http://mscmga.ms.ic.ac.uk/info.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cruz-Chavez, M.A., Frausto-Solis, J. (2004). Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds) Artificial Intelligence and Soft Computing - ICAISC 2004. ICAISC 2004. Lecture Notes in Computer Science(), vol 3070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24844-6_133
Download citation
DOI: https://doi.org/10.1007/978-3-540-24844-6_133
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22123-4
Online ISBN: 978-3-540-24844-6
eBook Packages: Springer Book Archive