{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:31:02Z","timestamp":1774373462325,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":4064,"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":[[2002,6]]},"DOI":"10.1016\/s0166-218x(01)00273-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:32:09Z","timestamp":1027596729000},"page":"181-203","source":"Crossref","is-referenced-by-count":65,"title":["A tabu search algorithm for scheduling a single robot in a job-shop environment"],"prefix":"10.1016","volume":"119","author":[{"given":"Johann","family":"Hurink","sequence":"first","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00273-6_BIB1","unstructured":"N. Ascheuer, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, Ph.D. Thesis, Technische Universit\u00e4t Berlin, 1995."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A branch & bound algorithm for the job-shop problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job-shop scheduling problem","volume":"41","author":"Dell\u2019 Amico","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB4","series-title":"Handbooks in Operations Research and Management Science, Vol. 8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","article-title":"Time constrained routing and scheduling","author":"Desrosiers","year":"1995"},{"key":"10.1016\/S0166-218X(01)00273-6_BIB5","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","article-title":"A generalized insertion heuristic for the traveling salesman problem with time windows","volume":"46","author":"Gendreau","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB6","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\/S0166-218X(01)00273-6_BIB7","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\/S0166-218X(01)00273-6_BIB8","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","article-title":"A block approach for single machine scheduling with release dates and due dates","volume":"26","author":"Grabowski","year":"1986","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB9","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":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB10","unstructured":"S. Knust, Shop-scheduling problems with transportation, Ph.D. Thesis, Fachbereich Mathematik\/Informatik Universit\u00e4t Osnabr\u00fcck, 1999."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB11","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":"Laarhoven","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1287\/opre.45.3.365","article-title":"Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints","volume":"45","author":"Mingozzi","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB13","series-title":"Industrial Scheduling","author":"Muth","year":"1963"},{"key":"10.1016\/S0166-218X(01)00273-6_BIB14","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast tabu search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00273-6_BIB15","doi-asserted-by":"crossref","unstructured":"E. Nowicki, C. Smutnicki, A fast tabu search algorithm for the permutation flow-shop problem, European J. Oper. Res. 91 (1996) 160\u2013175.","DOI":"10.1016\/0377-2217(95)00037-2"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002736?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002736?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:27:51Z","timestamp":1556735271000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0166218X01002736"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00273-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}