{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:17:12Z","timestamp":1726514232678},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4003,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0304-3975(01)00293-6","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T16:47:25Z","timestamp":1032281245000},"page":"101-117","source":"Crossref","is-referenced-by-count":4,"title":["The convergence of stochastic algorithms solving flow shop scheduling"],"prefix":"10.1016","volume":"285","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":"78","reference":[{"key":"10.1016\/S0304-3975(01)00293-6_BIB1","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(01)00293-6_BIB2","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1006\/jcph.1997.5781","article-title":"Stochastic simulations of two-dimensional composite packings","volume":"136","author":"Albrecht","year":"1997","journal-title":"J. Comput. Phys."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB3","unstructured":"A. Albrecht, S.K. Cheung, K.S. Leung, C.K. Wong, On the convergence of inhomogeneous markov chains approximating equilibrium placements of flexible objects, Comput. Optim. Appl., to appear."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB4","unstructured":"H. Baumg\u00e4rtel, Distributed constraint processing for production logistics, Practical Application of Constraint Technology, UK 1997."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB5","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1051\/ro\/1978120403331","article-title":"Ordonnancements a contraintes disjonctives","volume":"12","author":"Carlier","year":"1978","journal-title":"R.A.I.R.O, Oper. Res."},{"issue":"3","key":"10.1016\/S0304-3975(01)00293-6_BIB6","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1214\/aop\/1176989682","article-title":"Rough large deviation estimates for simulated annealing","volume":"20","author":"Catoni","year":"1992","journal-title":"Ann. Probab."},{"issue":"4","key":"10.1016\/S0304-3975(01)00293-6_BIB7","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1006\/jcom.1996.0035","article-title":"Metropolis, simulated annealing, and iterated energy transformation algorithms: theory and experiments","volume":"12","author":"Catoni","year":"1996","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(01)00293-6_BIB8","series-title":"Scheduling Theory and its Applications","author":"Chretienne","year":"1995"},{"key":"10.1016\/S0304-3975(01)00293-6_BIB9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flow shop and job shop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB10","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB11","doi-asserted-by":"crossref","unstructured":"L.A. Hall, Approximability of flow shop scheduling, 36th Annu. Symp. on Foundations of Computer Science, Milwaukee, Wisconsin, 1995, pp. 82\u201391.","DOI":"10.1109\/SFCS.1995.492465"},{"key":"10.1016\/S0304-3975(01)00293-6_BIB12","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","article-title":"The flow shop with parallel machines: A tabu search approach","volume":"106","author":"Nowicki","year":"1998","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB13","series-title":"Scheduling: Theory, Algorithms, and Systems, Prentice-Hall International Series in Industrial and Systems Engineering","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0304-3975(01)00293-6_BIB14","unstructured":"B. Roy, B. Sussmann, Les probl\u00e8mes d'Ordonnancement avec Constraints Disjonctives, Note DS No. 9 bis. SEMA, 1964."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB15","series-title":"Proc. RANDOM\u201998, Lecture Notes in Computer Science, Vol. 1518","first-page":"260","article-title":"On various cooling schedules for simulated annealing applied to the job shop problem.","author":"Steinh\u00f6fel","year":"1998"},{"issue":"3","key":"10.1016\/S0304-3975(01)00293-6_BIB16","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/S0377-2217(98)00326-9","article-title":"Two simulated annealing-based heuristics for the job shop scheduling problem.","volume":"118","author":"Steinh\u00f6fel","year":"1999","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/S0304-3975(01)00293-6_BIB17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"Van Laarhoven","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(01)00293-6_BIB18","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","article-title":"Short shop schedules","volume":"45","author":"Williamson","year":"1997","journal-title":"Oper. Res."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002936?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T14:48:03Z","timestamp":1583592483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0304397501002936"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00293-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}