{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:53:26Z","timestamp":1725494006005},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_23","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"277-290","source":"Crossref","is-referenced-by-count":3,"title":["Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Kathleen","family":"Steinh\u00f6fel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Albrecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chak-Kuen","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"23_CR1","unstructured":"E.H.L. Aarts. Local Search in Combinatorial Optimization. Wiley, New York, 1997."},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"E.H.L. Aarts, P.J.M. Van Laarhoven, J.K. Lenstra, and N.L.J. Ulder. A Computational Study of Local Search Algorithms for Shop Scheduling. ORSA J. on Computing, 6:118\u2013125, 1994.","journal-title":"ORSA J. on Computing"},{"key":"23_CR3","unstructured":"E.H.L. Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach. Wiley, New York, 1989."},{"key":"23_CR4","unstructured":"H. Baumg\u00e4rtel. Distributed Constraint Processing for Production Logistics. In PACT'97-Practical Application of Constraint Technology, Blackpool, UK, 1997."},{"issue":"3","key":"23_CR5","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":"23_CR6","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. J. of Complexity, 12(4):595\u2013623, 1996.","journal-title":"J. of Complexity"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0377-2217(93)E0228-P","volume":"80","author":"C. Chen","year":"1995","unstructured":"C. Chen, V.S. Vempati, and N. Aljaber. An Application of Genetic Algorithms for Flow Shop Problems. European J. of Operational Research, 80:389\u2013396, 1995.","journal-title":"European J. of Operational Research"},{"key":"23_CR8","unstructured":"P. Chretienne, E.G. Coffman, Jr., J.K. Lenstra, and Z. Liu. Scheduling Theory and Its Applications. Wiley, New York, 1995."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"3323","DOI":"10.1080\/002075497194093","volume":"35","author":"M.K. El-Najdawi","year":"1997","unstructured":"M.K. El-Najdawi. Multi-Cyclic Flow Shop Scheduling: An Application in Multi-Stage, Multi-Product Production Processes. International J. of Production Research, 35:3323\u20133332, 1997.","journal-title":"International J. of Production Research"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson, and R. Sethi. The Complexity of Flow Shop and Job Shop Scheduling. Mathematics of Operations Research, 1:117\u2013129, 1976.","journal-title":"Mathematics of Operations Research"},{"key":"23_CR11","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":"23_CR12","doi-asserted-by":"crossref","unstructured":"L.A. Hall. Approximability of Flow Shop Scheduling. In 36th Annual Symposium on Foundations of Computer Science, pp. 82\u201391, Milwaukee, Wisconsin, 1995.","DOI":"10.1109\/SFCS.1995.492465"},{"key":"23_CR13","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":"23_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1018970020599","volume":"70","author":"G. Liu","year":"1997","unstructured":"G. Liu, P.B. Luh, and R. Resch. Scheduling Permutation Flow Shops Using The Lagrangian Relaxation Technique. Annals of Operations Research, 70:171\u2013189, 1997.","journal-title":"Annals of Operations Research"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","volume":"106","author":"E. Nowicki","year":"1998","unstructured":"E. Nowicki and C. Smutnicki. The Flow Shop with Parallel Machines: A Tabu Search Approach. European J. of Operational Research, 106:226\u2013253, 1998.","journal-title":"European J. of Operational Research"},{"key":"23_CR16","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":"23_CR17","unstructured":"B. Roy and B. Sussmann. Les probl\u00e8mes d'Ordonnancement avec Constraints Disjonctives. Note DS No.9 bis. SEMA, 1964."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0377-2217(93)E0326-S","volume":"80","author":"D.L. Santos","year":"1995","unstructured":"D.L. Santos, J.L. Hunsucker, and D.E. Deal. Global Lower Bounds for Flow Shops with Multiple Processors. European J. of Operational Research, 80:112\u2013120, 1995.","journal-title":"European J. of Operational Research"},{"key":"23_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-49543-6_21","volume-title":"Proc. RANDOM'98","author":"K. Steinh\u00f6fel","year":"1998","unstructured":"K. Steinh\u00f6fel, A. Albrecht, and C.K. Wong. On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem. In M. Luby, J. Rolim, and M. Serna, editors, Proc. RANDOM'98, pages 260\u2013279, Lecture Notes in Computer Science, vol. 1518, 1998."},{"issue":"3","key":"23_CR20","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 J. of Operational Research, 118(3):524\u2013548,1999.","journal-title":"European J. of Operational Research"},{"issue":"3","key":"23_CR21","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. J. of Computer and System Science, 10(3):384\u2013393, 1975.","journal-title":"J. of Computer and System Science"},{"issue":"1","key":"23_CR22","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":"23_CR23","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'janov, and D.B. Shmoys. Short Shop Schedules. Operations Research, 45:288\u2013294, 1997.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T17:09:45Z","timestamp":1551028185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}