{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T01:37:08Z","timestamp":1698629828277},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":4337,"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":[[2001,9]]},"DOI":"10.1016\/s0166-218x(00)00315-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:16:06Z","timestamp":1027631766000},"page":"179-197","source":"Crossref","is-referenced-by-count":18,"title":["Local search algorithms for a single-machine scheduling problem with positive and negative time-lags"],"prefix":"10.1016","volume":"112","author":[{"given":"Johann","family":"Hurink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Keuchel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00315-2_BIB1","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","year":"1997"},{"key":"10.1016\/S0166-218X(00)00315-2_BIB2","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(00)00315-2_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","article-title":"Scheduling project networks with resource constraints and time windows","volume":"16","author":"Bartusch","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","article-title":"One-machine scheduling with delayed precedence constraints and its use in job shop scheduling","volume":"41","author":"Balas","year":"1995","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00015-3","article-title":"A branch & bound algorithm for Scheduling problems with positive and negative time-lags","volume":"94","author":"Brucker","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","article-title":"A branch & bound algorithm for the open shop problem","volume":"76","author":"Brucker","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A fast branch & bound algorithm for the job-shop scheduling problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/12460125.1996.10511678","article-title":"Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: the minimum project-duration and resource-levelling problems","volume":"5","author":"Brinkmann","year":"1996","journal-title":"J. Decision Systems"},{"key":"10.1016\/S0166-218X(00)00315-2_BIB9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one-machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB10","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0377-2217(97)00305-6","article-title":"A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations","volume":"111","author":"De Reyck","year":"1998","journal-title":"European J. Operl. Res."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB11","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'Amico","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB12","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1287\/mnsc.38.9.1245","article-title":"The analysis of activity networks under generalized precedence relations","volume":"38","author":"Elmaghraby","year":"1992","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB13","series-title":"Industrial Scheduling","first-page":"225","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"Fisher","year":"1963"},{"key":"10.1016\/S0166-218X(00)00315-2_BIB14","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. Operl. Res."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB15","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":"15","author":"Hurink","year":"1994","journal-title":"OR-Spektrum"},{"key":"10.1016\/S0166-218X(00)00315-2_BIB16","unstructured":"J. Keuchel, Lokale Suchverfahren f\u00fcr Einmaschinenprobleme mit positiven und negativen Time Lags, Diplomarbeit, Universit\u00e4t Osnabr\u00fcck, 1997."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB17","unstructured":"S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, GSIA, Carnegie Mellon University, 1984."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB18","unstructured":"K. Neumann, C. Schwindt, Projects with minimal and maximal time lags: construction of activity-on-node networks and applications, Technical Report WIOR-447, Institut f\u00fcr Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1995."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB19","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1993","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB20","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0166-218X(00)00315-2_BIB21","first-page":"2437","article-title":"Contribution de la th\u00e9orie des graphes \u00e0 l\u2019\u00e9tude de certains probl\u00e8mes lin\u00e9aires","volume":"248","author":"Roy","year":"1959","journal-title":"C.R. Acad. Sci. T"},{"key":"10.1016\/S0166-218X(00)00315-2_BIB22","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB23","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0167-6377(94)90064-7","article-title":"One-machine generalized precedence constrained scheduling problems","volume":"16","author":"Wikum","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(00)00315-2_BIB24","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0377-2217(94)90016-7","article-title":"Heuristics for scheduling resource-constrained projects in MPM networks","volume":"76","author":"Zhan","year":"1994","journal-title":"European J. Operl. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003152?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003152?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:26:46Z","timestamp":1555770406000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0166218X00003152"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00315-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}