{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:09:31Z","timestamp":1779898171176,"version":"3.53.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":5191,"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":[[1999,5]]},"DOI":"10.1016\/s0166-218x(99)00015-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"77-99","source":"Crossref","is-referenced-by-count":43,"title":["A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags"],"prefix":"10.1016","volume":"94","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Hilbig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johann","family":"Hurink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00015-3_BIB1","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(99)00015-3_BIB2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","article-title":"Scheduling multiprocessor tasks on three dedicated processors","volume":"41","author":"Blazewicz","year":"1992","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0166-218X(99)00015-3_BIB3","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"},{"issue":"No. 179","key":"10.1016\/S0166-218X(99)00015-3_BIB4","article-title":"A Branch & Bound algorithm for scheduling problems with positive and negative time-lags","author":"Brucker","year":"1996","journal-title":"Osnabr\u00fccker Schriften zur Mathematik, Reihe P"},{"key":"10.1016\/S0166-218X(99)00015-3_BIB5","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(99)00015-3_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02085636","article-title":"The job-shop problem and immediate selection","volume":"50","author":"Brucker","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00015-3_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(99)00015-3_BIB8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","article-title":"Job-shop scheduling with multi-purpose machines","volume":"45","author":"Brucker","year":"1990","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(99)00015-3_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":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00015-3_BIB10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(99)00015-3_BIB11","doi-asserted-by":"crossref","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","author":"De Reyck","year":"1996"},{"key":"10.1016\/S0166-218X(99)00015-3_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":"Management Sci."},{"key":"10.1016\/S0166-218X(99)00015-3_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(99)00015-3_BIB14","series-title":"Scheduling Probleme mit Start-Start-Relationen","author":"Hilbig","year":"1996"},{"key":"10.1016\/S0166-218X(99)00015-3_BIB15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","article-title":"Complexity of scheduling multiprocessor tasks with prespecified processor allocation","volume":"55","author":"Hoogeveen","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00015-3_BIB16","article-title":"Scheduling jobs in shops with multi-purpose machines","author":"Jurisch","year":"1993"},{"key":"10.1016\/S0166-218X(99)00015-3_BIB17","article-title":"Zur Struktur und L\u00f6sung verallgemeinerter Shop-Scheduling-Probleme","author":"Kleinau","year":"1993"},{"key":"10.1016\/S0166-218X(99)00015-3_BIB18","series-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques","author":"Lawrence","year":"1984"},{"key":"10.1016\/S0166-218X(99)00015-3_BIB19","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","article-title":"On the complexity of scheduling with batch setup times","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00015-3_BIB20","article-title":"Projects with minimal and maximal time lags: construction of activity-on-node networks and applications","author":"Neumann","year":"1995"},{"key":"10.1016\/S0166-218X(99)00015-3_BIB21","article-title":"Contribution de la th\u00e9orie des graphes \u00e0 l'\u00e9tude de certains probl\u00e8mes lin\u00e9aires","volume":"248","author":"Roy","year":"1959"},{"key":"10.1016\/S0166-218X(99)00015-3_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 Journal of Operational Research"},{"key":"10.1016\/S0166-218X(99)00015-3_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(99)00015-3_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":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00015-3_BIB25","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","article-title":"The one-machine problem with delayed precedence constraints and its use in job shop scheduling","volume":"41","author":"Balas","year":"1995","journal-title":"Management Science"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000153?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000153?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:53:41Z","timestamp":1556117621000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0166218X99000153"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00015-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}