{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:12:52Z","timestamp":1775052772624,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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":[[1997,1]]},"DOI":"10.1016\/s0166-218x(96)00036-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"47-69","source":"Crossref","is-referenced-by-count":58,"title":["Improving local search heuristics for some scheduling problems. Part II"],"prefix":"10.1016","volume":"72","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\/S0166-218X(96)00036-4_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","article-title":"The complexity of one-machine batching problems","volume":"47","author":"Albers","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(95)00030-U","article-title":"Improving local search heuristics for some scheduling problems","volume":"65","author":"Brucker","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","article-title":"Batch sizing and job sequencing on a single machine","volume":"26","author":"Coffman","year":"1990","journal-title":"Ann. of Oper. Res."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"L Graham","year":"1979","journal-title":"Ann. of Discrete Math."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two-and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Res. Logistic Quart."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB6","series-title":"Simulated annealing: theory and applications","author":"van Laarhoven","year":"1987"},{"key":"10.1016\/S0166-218X(96)00036-4_BIB7","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."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB8","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\/S0166-218X(96)00036-4_BIB9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precedence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB10","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\/S0166-218X(96)00036-4_BIB11","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1287\/opre.28.4.942","article-title":"Sequencing to minimize the maximum job cost","volume":"28","author":"Monma","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00036-4_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart"},{"key":"10.1016\/S0166-218X(96)00036-4_BIB13","article-title":"Genetic local search: a population-based search algorithm","author":"Ulder","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:26:13Z","timestamp":1556652373000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0166218X96000364"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00036-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}