{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:53:01Z","timestamp":1770990781063,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0305-0548(99)00064-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:18:34Z","timestamp":1027649914000},"page":"895-903","source":"Crossref","is-referenced-by-count":23,"title":["Analysis of solution space-dependent performance of simulated annealing: the case of the multi-level capacitated lot sizing problem"],"prefix":"10.1016","volume":"27","author":[{"given":"G\u00fclay","family":"Barbaroso\u011flu","sequence":"first","affiliation":[]},{"given":"Linet","family":"\u00d6zdamar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00064-7_BIB1","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","article-title":"A Lagrangean-based heuristic for dynamic multi-item multi-level constrained lot sizing with setup times","volume":"42","author":"Tempelmeir","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1080\/07408179408966591","article-title":"Multi-item lot sizing in capacitated multi-stage serial systems","volume":"26","author":"Billington","year":"1994","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0377-2217(91)90130-N","article-title":"Multi-level capacitated lot sizing complexity and LP-based heuristics","volume":"53","author":"Maes","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02248584","article-title":"Analysis of relaxations for the multi-item capacitated lot sizing problem","volume":"26","author":"Chen","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB5","first-page":"319","article-title":"Linear programming, simulated annealing and tabu search heuristics for lot sizing in bottleneck assembly systems","volume":"11","author":"Kuik","year":"1993","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB6","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","article-title":"Computational complexity of the capacitated lot size problem","volume":"28","author":"Bitran","year":"1982","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB7","unstructured":"Garey M, Johnson D. Computers and intractability: a guide to the theory of NP-completeness. San Francisco CA: Freeman, 1979."},{"key":"10.1016\/S0305-0548(99)00064-7_BIB8","first-page":"671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB9","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB10","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1992.75","article-title":"General purpose simulated annealing","volume":"43","author":"Connolly","year":"1992","journal-title":"Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB11","doi-asserted-by":"crossref","unstructured":"Abramson D, Dang H, Krishnamoorthy M. A comparison of two methods for solving 0\u20131 integer programmes using a general purpose simulated annealing algorithm. Working Paper, School of Computing and Information Technology, Griffith University, Australia, 1996.","DOI":"10.1007\/BF02601642"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","article-title":"Simulated annealing: practice versus theory","volume":"18","author":"Ingberg","year":"1994","journal-title":"Journal of Mathematical Computational Modelling"},{"key":"10.1016\/S0305-0548(99)00064-7_BIB13","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1080\/002075498193336","article-title":"Simultaneous lot sizing and loading of product families on parallel facilities of different classes","volume":"36","author":"\u201dOzdamar","year":"1998","journal-title":"International Journal of Production Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000647?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000647?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T19:58:36Z","timestamp":1555271916000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0305054899000647"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00064-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}