{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:41:23Z","timestamp":1725565283777},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221234"},{"type":"electronic","value":"9783540248446"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24844-6_133","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:21:19Z","timestamp":1284160879000},"page":"860-865","source":"Crossref","is-referenced-by-count":6,"title":["Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds"],"prefix":"10.1007","author":[{"given":"Marco Antonio","family":"Cruz-Chavez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Frausto-Solis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"133_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"I","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of Flow shop and Job shop Scheduling. Mathematics of Operations Research\u00a0I(2), 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"133_CR2","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)"},{"key":"133_CR3","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E. Balas","year":"1969","unstructured":"Balas, E.: Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res.\u00a017, 941\u2013957 (1969)","journal-title":"Oper. Res."},{"issue":"4598","key":"133_CR4","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., S.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"133_CR5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"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\u00a06, 118\u2013125 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"133_CR6","volume-title":"Scheduling Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Prentice-Hall, U.S.A (1995)"},{"key":"133_CR7","unstructured":"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)"},{"issue":"1","key":"133_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Laarhoven Van","year":"1992","unstructured":"Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res.\u00a040(1), 113\u2013125 (1992)","journal-title":"Oper. Res."},{"key":"133_CR9","first-page":"237","volume-title":"Job-shop scheduling by simulated annealing combined with deterministic local search, Meta-heuristics: theory and applications","author":"T. Yamada","year":"1996","unstructured":"Yamada, T., Nakano, R.: Job-shop scheduling by simulated annealing combined with deterministic local search, Meta-heuristics: theory and applications, pp. 237\u2013248. Kluwer Academic Publishers, USA (1996)"},{"key":"133_CR10","volume-title":"A simulated annealing approach to job shop scheduling using critical block transition operators","author":"T. Yamada","year":"1994","unstructured":"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"},{"key":"133_CR11","doi-asserted-by":"crossref","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Mgmt. Sci. 34 (1988)","DOI":"10.1287\/mnsc.34.3.391"},{"issue":"11","key":"133_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","volume":"18","author":"L. Ingber","year":"1993","unstructured":"Ingber, L.: Simulated annealing: Practice versus theory. Mathematical Computer Modelling\u00a018(11), 29\u201357 (1993)","journal-title":"Mathematical Computer Modelling"},{"key":"133_CR13","unstructured":"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\u2013479 (1991)"},{"key":"133_CR14","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1049\/PBCE055E"},{"key":"133_CR15","unstructured":"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)"},{"key":"133_CR16","unstructured":"Beasley, J.E.: OR Library, Imperial College, Management School (1990), http:\/\/mscmga.ms.ic.ac.uk\/info.html"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing - ICAISC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24844-6_133.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:57:09Z","timestamp":1605743829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24844-6_133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221234","9783540248446"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24844-6_133","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}