{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:50:12Z","timestamp":1761486612689},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0166-218x(95)00030-u","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"97-122","source":"Crossref","is-referenced-by-count":49,"title":["Improving local search heuristics for some scheduling problems\u2014I"],"prefix":"10.1016","volume":"65","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Hurink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00030-U_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","article-title":"Tabu search techniques: a tutorial and an application to neural networks","volume":"11","author":"de Werra","year":"1989","journal-title":"OR Spectrum"},{"key":"10.1016\/0166-218X(95)00030-U_BIB2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(95)00030-U_BIB3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search, Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0166-218X(95)00030-U_BIB4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search, Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0166-218X(95)00030-U_BIB5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(95)00030-U_BIB6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","article-title":"Sequencing jobs to minimize total weighted completion time subject to precedence constraints","volume":"2","author":"Lawler","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(95)00030-U_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(92)90028-2","article-title":"Large-step Markov chains for the TSP incorporating local search heuristics","volume":"11","author":"Martin","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(95)00030-U_BIB8","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","article-title":"Minimizing total costs in one-machine scheduling","volume":"23","author":"Kan","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(95)00030-U_BIB9","article-title":"L\u00f6sung von multi-purpose Job-Shop Problemen durch Tabu-Suche","author":"Thole","year":"1993"},{"key":"10.1016\/0166-218X(95)00030-U_BIB10","article-title":"Genetic local search: a population-based search algorithm","author":"Ulder","year":"1990"},{"key":"10.1016\/0166-218X(95)00030-U_BIB11","series-title":"Simulated Annealing. Theory and Applications","author":"Van Laarhoven","year":"1987"},{"key":"10.1016\/0166-218X(95)00030-U_BIB12","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500030U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500030U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:22:45Z","timestamp":1555575765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500030U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0166218X9500030U"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00030-u","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}