{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:13:25Z","timestamp":1725725605842},"publisher-location":"Boston, MA","reference-count":12,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441954039"},{"type":"electronic","value":"9781475741377"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-1-4757-4137-7_27","type":"book-chapter","created":{"date-parts":[[2013,5,11]],"date-time":"2013-05-11T12:01:20Z","timestamp":1368273680000},"page":"575-600","source":"Crossref","is-referenced-by-count":0,"title":["Random Start Local Search and Tabu Search for a Discrete Lot-Sizing and Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Ana","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Filipe","family":"Carvalho","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Constantino","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o Pedro","family":"Pedroso","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"references>J. Wesley Barnes and Manuel Laguna. A tabu search experience in production scheduling. In F. Glover, M. Laguna, E. Taillard, and D. de Werra, editors, Annals of Operations Research, volume 41, pages 141\u2013156. J. C. Baltzer AG, 1993.","DOI":"10.1007\/BF02023072"},{"key":"27_CR2","volume-title":"A library of models and matrices for lot-sizing problems. Internal report","author":"G Belvaux","year":"1999","unstructured":"G. Belvaux and L. A. Wolsey. Lotsizelib: A library of models and matrices for lot-sizing problems. Internal report, Center for Operations Research and Econometrics, Universite Catholique de Louvain, 1999."},{"key":"27_CR3","volume-title":"Discussion paper","author":"G Belvaux","year":"2000","unstructured":"Gaetan Belvaux and Laurence A. Wolsey. Modelling practical lot-sizing problems as mixed integer programs. Discussion paper, Center for Operations Research and Econometrics, Belgium, 2000."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"A. Drexl and A. Kimms. Lot sizing and scheduling \u2014 Survey and extensions. European Journal of Operational Research, 99: 221\u2013235, 1997.","journal-title":"European Journal of Operational Research"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"Fred","year":"1989","unstructured":"Fred Glover. Tabu search \u2014 Part I. ORSA Journal on Computing, 1: 190\u2013206, 1989.","journal-title":"Orsa Journal on Computing"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"Fred","year":"1990","unstructured":"Fred Glover. Tabu search \u2014 Part II. ORSA Journal on Computing, 2: 4\u201332, 1990.","journal-title":"Orsa Journal on Computing"},{"issue":"12","key":"27_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(01)00263-3","volume":"119","author":"F Glover","year":"2002","unstructured":"Fred Glover and Said Hanafi. Tabu search and finite convergence. Discrete Applied Mathematics, 119 (1\u20132): 3\u201336, 2002.","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR8","first-page":"47","volume":"7","author":"N Said","year":"2000","unstructured":"Said Hanafi. On the convergence of tabu search. Journal of Heuristics, 7: 47\u201358, 2000.","journal-title":"Journal of Heuristics"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0377-2217(94)90072-8","volume":"75","author":"R Kuik","year":"1994","unstructured":"R. Kuik, M. Salomon, and L.N. van Wassenhove. Batching decisions: structure and models. European Journal of Operational Research, 75: 243\u2013263, 1994.","journal-title":"European Journal of Operational Research"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Thomas Lengauer. Combinatorial Algorithms for Integrated Circuit Layout, chapter 8, pages 427\u2013446. John Wiley and Sons, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"27_CR11","unstructured":"A. Pereira, F. Carvalho, J. Pedroso, and M. Constantino. Benchmark instances for dynamic lot sizing and scheduling problems. Internet repository, 2001. http:\/\/www.ncc.up.pt\/ jpp\/dlsp."},{"key":"27_CR12","volume-title":"A Polyhedral Approach to the Discrete Lot-Sizing and Scheduling Problem","author":"C Eijl","year":"1996","unstructured":"C. van Eijl. A Polyhedral Approach to the Discrete Lot-Sizing and Scheduling Problem. PhD thesis, Technische Universiteit Eindhoven, 1996."}],"container-title":["Applied Optimization","Metaheuristics: Computer Decision-Making"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4757-4137-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:01:21Z","timestamp":1557709281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4757-4137-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9781441954039","9781475741377"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4757-4137-7_27","relation":{},"ISSN":["1384-6485"],"issn-type":[{"type":"print","value":"1384-6485"}],"subject":[],"published":{"date-parts":[[2003]]}}}