{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:48:35Z","timestamp":1761486515602},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00210-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:08:03Z","timestamp":1027577283000},"page":"288-302","source":"Crossref","is-referenced-by-count":22,"title":["Tabu list management methods for a discrete\u2013continuous scheduling problem"],"prefix":"10.1016","volume":"137","author":[{"given":"Joanna","family":"J\u00f3zefowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Walig\u00f3ra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"W\u0229glarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00210-7_BIB1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future path for integer programming and links to artificial intelligence","volume":"5","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00210-7_BIB2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 part 1","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(01)00210-7_BIB3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 part 2","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(01)00210-7_BIB4","unstructured":"Glover, F., Laguna, M., 1993. Tabu search. In: Reeves, C.R. (Ed.), Modern Heuristic Techniques for Combinatorial Problems. Blackwell, Oxford (Chapter 3)"},{"key":"10.1016\/S0377-2217(01)00210-7_BIB5","unstructured":"J\u00f3zefowska, J., Walig\u00f3ra, G., W\u0119glarz, J., 1996. A Tabu search algorithm for some discrete\u2013continuous scheduling problems. In: Rayward-Smith, V.J. (Ed.), Modern Heuristics Search Methods. Wiley, New York, pp. 169\u2013182"},{"issue":"2","key":"10.1016\/S0377-2217(01)00210-7_BIB6","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0377-2217(97)00346-9","article-title":"On a methodology for discrete\u2013continuous scheduling","volume":"107","author":"J\u00f3zefowska","year":"1998","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(01)00210-7_BIB7","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0377-2217(97)00345-7","article-title":"Local search metaheuristics for some discrete\u2013continuous scheduling problems","volume":"107","author":"J\u00f3zefowska","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00210-7_BIB8","unstructured":"J\u00f3zefowska, J., Walig\u00f3ra, G., W\u0119glarz, J., 1998b. Tabu search with the Cancellation Sequence Method for a class of discrete\u2013continuous scheduling problems. In: Proceedings of the Fifth International Symposium on Methods and Models in Automation and Robotics MMAR'98. Mi\u0119dzyzdroje, 25\u201329.08.1998, pp. 1047\u20131052"},{"key":"10.1016\/S0377-2217(01)00210-7_BIB9","unstructured":"Lawrence, C., Zhou, J.L., Tits, A.L., 1995. Users guide for CFSQP Version 2.3 (Released August 1995), available by e-mail: andre@eng.umd.edu"},{"key":"10.1016\/S0377-2217(01)00210-7_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA Journal of Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T04:26:27Z","timestamp":1556857587000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701002107"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00210-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}