{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:02Z","timestamp":1725485582021},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_21","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:58:05Z","timestamp":1181185085000},"page":"260-279","source":"Crossref","is-referenced-by-count":7,"title":["On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem"],"prefix":"10.1007","author":[{"given":"K.","family":"Steinh\u00f6fel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Albrecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. K.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"21_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E.H.L. Aarts","year":"1998","unstructured":"E.H.L. Aarts. Local Search in Combinatorial Optimization. Wiley & Sons, New York, 1998."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1006\/jcph.1997.5781","volume":"136","author":"A. Albrecht","year":"1997","unstructured":"A. Albrecht, S.K. Cheung, K.S. Leung, and C.K. Wong. Stochastic Simulations of Two-Dimensional Composite Packings. Journal of Computational Physics, 136(2):559\u2013579, 1997.","journal-title":"Journal of Computational Physics"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1214\/aop\/1176989682","volume":"20","author":"O. Catoni","year":"1992","unstructured":"O. Catoni. Rough Large Deviation Estimates for Simulated Annealing: Applications to Exponential Schedules. Annals of Probability, 20(3):1109\u20131146, 1992.","journal-title":"Annals of Probability"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1006\/jcom.1996.0035","volume":"12","author":"O. Catoni","year":"1996","unstructured":"O. Catoni. Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments. Journal of Complexity, 12(4):595\u2013623, 1996.","journal-title":"Journal of Complexity"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1057\/palgrave.jors.2600416","volume":"48","author":"J.-H. Cho","year":"1997","unstructured":"J.-H. Cho and Y.-D. Kim. A Simulated Annealing Algorithm for Resource Constrained Project Scheduling Problems. Journal of the Operational Society, 48:736\u2013745, 1997.","journal-title":"Journal of the Operational Society"},{"key":"21_CR6","volume-title":"Scheduling Theory and Its Applications","author":"P. Chretienne","year":"1998","unstructured":"P. Chretienne, E.G. Coffman, Jr., J.K. Lenstra, and Z. Liu. Scheduling Theory and Its Applications. Wiley & Sons, New York, 1998."},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"M.R. Garey and D.S. Johnson. Complexity Results for Multiprocessor Scheduling under Resource Constraints. SIAM Journal on Computing, 4(4):397\u2013411, 1975.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"B. Hajek. Cooling Schedules for Optimal Annealing. Mathematics of Operations Research, 13:311\u2013329, 1988.","journal-title":"Mathematics of Operations Research"},{"key":"21_CR9","unstructured":"J.A. Hoogeveen, J.K. Lenstra, and S.L. van de Velde. Sequencing and Scheduling: An Annotated Bibliography. Technical Report COSOR 97-2, Dept. of Mathematics and Computing Science, Eindhoven University of Technology, 1997."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, Jr., and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"21_CR11","unstructured":"C.Y. Lee and L. Lei, editors. Scheduling: Theory and Applications. Annals of Operations Research, Journal Edition. Baltzer Science Publ. BV, Amsterdam, 1997."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018909801944","volume":"70","author":"C.Y. Lee","year":"1997","unstructured":"C.Y. Lee, L. Lei, and M. Pinedo. Current Trends in Deterministic Scheduling. Annals of Operations Research, 70:1\u201341, 1997.","journal-title":"Annals of Operations Research"},{"volume-title":"Industrial Scheduling","year":"1963","key":"21_CR13","unstructured":"J.F. Muth, G.L. Thompson, and P.R. Winters, editors. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J., 1963."},{"key":"21_CR14","series-title":"Prentice Hall International Series in Industrial and Systems Engineering","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall International Series in Industrial and Systems Engineering. Prentice Hall, Englewood Cliffs, N.J., 1995."},{"key":"21_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-60469-3_28","volume-title":"Evolutionary Computing, Selected Papers","author":"P. Ross","year":"1995","unstructured":"P. Ross and D. Come. Comparing Genetic Algorithms, Simulated Annealing and Stochastic Hillclimbing on Timetabling Problems. In T.E. Fogarty, editor, Evolutionary Computing, Selected Papers, Lecture Notes in Computer Science, vol. 993, pages 94\u2013102, 1995."},{"key":"21_CR16","unstructured":"B. Roy and B. Sussmann. Les probl\u00e8mes d\u2019Ordonnancement avec Constraints Disjonctives. Note DS No.9 bis. SEMA, 1964."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02601640","volume":"63","author":"N.M. Sadeh","year":"1996","unstructured":"N.M. Sadeh and Y. Nakakuki. Focused Simulated Annealing Search: An Application to Job Shop Scheduling. Annals of Operations Research, 63:77\u2013103, 1996.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J.D. Ullman","year":"1975","unstructured":"J.D. Ullman. NP-Complete Scheduling Problems. Journal of Computer and System Science, 10(3):384\u2013393, 1975.","journal-title":"Journal of Computer and System Science"},{"key":"21_CR19","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","volume":"8","author":"R.J.M. Vaessens","year":"1996","unstructured":"R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Local Search. INFORMS Journal on Computing, 8:302\u2013117, 1996.","journal-title":"INFORMS Journal on Computing"},{"key":"21_CR20","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.M. Laarhoven Van","year":"1988","unstructured":"P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Simulated Annealing: Theory and Applications. D. Reidel Publ. Comp., Dordrecht, 1988."},{"issue":"1","key":"21_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Laarhoven Van","year":"1992","unstructured":"P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 40(1):113\u2013125, 1992.","journal-title":"Operations Research"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D.P. Williamson","year":"1997","unstructured":"D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast\u2019janov, and D.B. Shmoys. Short Shop Schedules. Operations Research, 45:288\u2013294, 1997.","journal-title":"Operations Research"},{"issue":"6","key":"21_CR23","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1137\/S0097539794266407","volume":"25","author":"D. Zuckerman","year":"1996","unstructured":"D. Zuckerman. On Unapproximable Versions of NP-Complete Problems. SIAM Journal on Computing, 25(6):1293\u20131304, 1996.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:46:51Z","timestamp":1550386011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}