{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:06:42Z","timestamp":1768558002137,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0377-2217(98)80001-5","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"266-276","source":"Crossref","is-referenced-by-count":22,"title":["Tabu search for resource-constrained scheduling"],"prefix":"10.1016","volume":"106","author":[{"given":"M.G.A.","family":"Verhoeven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)80001-5_BIB1","series-title":"Scheduling in Computer and Manufacturing Systems","author":"Blazewicz","year":"1994"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB2","article-title":"A global tabu search procedure for the general multiprocessor job shop scheduling problem","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1995"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search - Part 1","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A user's guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job shop scheduling problem with multi-purpose machines","volume":"16","author":"Hurink","year":"1994","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB6","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01719262","article-title":"Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling","volume":"17","author":"Leon","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB8","article-title":"A fast taboo search algorithm for the job shop problem","author":"Nowicki","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB9","article-title":"Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach","author":"Nuijten","year":"1994"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB10","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB11","series-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB12","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1002\/1520-6750(199308)40:5<665::AID-NAV3220400509>3.0.CO;2-J","article-title":"Local search techniques for the generalized resource-constrained project scheduling problem","volume":"40","author":"Sampson","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB13","series-title":"Advances in Project Scheduling","year":"1989"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB14","series-title":"Proceedings of the Seventh Symposium on Theoretical Aspects of Computer Science","first-page":"298","article-title":"The analysis of local search problems and their heuristics","author":"Yannakakis","year":"1990"},{"key":"10.1016\/S0377-2217(98)80001-5_BIB15","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1080\/09537289508930263","article-title":"An exchange heuristic for resource constrained scheduling with consideration given to opportunities for parallel processing","volume":"6","author":"Yoo","year":"1995","journal-title":"Production Planning and Control"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798800015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798800015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:58:25Z","timestamp":1556643505000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798800015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":15,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221798800015"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)80001-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}