{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T19:10:01Z","timestamp":1737400201741,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410560"},{"type":"electronic","value":"9783540453567"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45356-3_24","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:33:28Z","timestamp":1188358408000},"page":"243-252","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Simulated Annealing for Job Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathleen","family":"Steinh\u00f6fel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chak-Kuen","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"E.H.L. Aarts. Local Search in Combinatorial Optimization. Wiley & Sons, 1998."},{"key":"24_CR2","unstructured":"E.H.L. Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach. Wiley & Sons, 1989."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"M. Besch, H. Bi, P. Enskonatus, G. Heber, M. Wilhelmi. High-level Data Parallel Programming in PROMOTER. Proc. Intern. Workshop on High-level Parallel Programming Models and Supportive Environments, pp. 47\u201354, 1997.","DOI":"10.1109\/HIPS.1997.582955"},{"key":"24_CR4","unstructured":"H. Bi, M. Kessler, H. W. Pohl, M. Tief. Promise-High-level Data-parallel Programming Environment. Proc. 3 rd Workshop on Advanced Parallel Processing Technologies, pp. 207\u2013211, 1999."},{"issue":"4","key":"24_CR5","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":"24_CR6","unstructured":"A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1137\/0218076","volume":"18","author":"D. Helmbold","year":"1989","unstructured":"D. Helmbold and E. Mayr. The Two Processor Scheduling is in NC. SIAM Journal on Computing, 18:1140\u20131148, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"H. Jung, P. Spirakis, and M. Serna. A Parallel Algorithm for the Two Processor Constrained Scheduling. Proc. 18 th ICALP, pp. 417\u2013425, 1991.","DOI":"10.1007\/3-540-54233-7_152"},{"key":"24_CR9","volume-title":"Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques","author":"S. Lawrence","year":"1984","unstructured":"S. Lawrence, Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 1984."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"F.T. Leighton","year":"1999","unstructured":"F.T. Leighton, B.M. Maggs, and A.W. Richa, Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Combinatorica, 19:375\u2013401, 1999.","journal-title":"Combinatorica"},{"volume-title":"Industrial Scheduling","year":"1963","key":"24_CR11","unstructured":"J.F. Muth, G.L. Thompson, and P.R. Winters, editors. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J., 1963."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1018903912673","volume":"83","author":"M. Perregaard","year":"1998","unstructured":"M. Perregaard and J. Clausen. Parallel Branch-and-Bound Methods for the Job-Shop Scheduling Problem. Annals of Operations Research, 83:137\u2013160, 1998.","journal-title":"Annals of Operations Research"},{"key":"24_CR13","unstructured":"B. Roy and B. Sussmann. Les probl\u00e8mes d\u2019Ordonnancement avec Constraints Disjonctives. Note DS No.9 bis. SEMA, 1964."},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/S0377-2217(98)00326-9","volume":"118","author":"K. Steinh\u00f6fel","year":"1999","unstructured":"K. Steinh\u00f6fel, A. Albrecht, and C.K. Wong. Two Simulated Annealing-Based Heuristics for the Job Shop Scheduling Problem. European Journal of Operational Research, 118(3):524\u2013548, 1999.","journal-title":"European Journal of Operational Research"},{"key":"24_CR15","unstructured":"K. Steinh\u00f6fel, A. Albrecht, and C.K. Wong. On Parallel Heuristics for the Job Shop Scheduling Problem. In: S.Q. Zheng (ed.), Proc. Intern. Conf. on Parallel and Distributed Computing and Systems, pp. 806\u2013811, 1999."},{"key":"24_CR16","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R.H. Storer","year":"1992","unstructured":"Storer, R.H., Wu, S.D., and Vaccari, R., New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling, Management Science, 38:1495\u20131509, 1992.","journal-title":"Management Science"},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E. Taillard","year":"1994","unstructured":"E. Taillard. Parallel Taboo Search Techniques for the Job-Shop Scheduling Problem. ORSA Journal on Computing, 6:108\u2013117, 1994.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"24_CR18","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":"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":"24_CR19","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1137\/0216050","volume":"16","author":"U.V. Vazirani","year":"1987","unstructured":"U.V. Vazirani and V.V. Vazirani. The Two Processor Scheduling is in Random NC. SIAM Journal on Computing, 16:747\u2013759, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"M.G.A. Verhoeven, H.M.M. ten Eikelder, B.J.M. Aarts and E.H.L. Aarts. Sequential and Parallel Local Search Algorithms for Job Shop Scheduling. Meta-Heuristics (Advances and Trends in Local Search Paradigms for Optimization), pp. 359\u2013371, 1999.","DOI":"10.1007\/978-1-4615-5775-3_25"},{"key":"24_CR21","doi-asserted-by":"crossref","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"},{"key":"24_CR22","unstructured":"Yamada, T. and Nakano, R., A Genetic Algorithm Applicable to Large-Scale Job Shop Problems, In: R. Manner and B. Manderick (eds.), Proc. 2 nd International Conf. on Parallel Problem Solving from Nature, North-Holland, Amsterdam, 1992, pp. 281\u2013290."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature PPSN VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45356-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:33:27Z","timestamp":1737398007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45356-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410560","9783540453567"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45356-3_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}