{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T10:42:25Z","timestamp":1768905745896,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Ne 137\/4"],"award-info":[{"award-number":["Ne 137\/4"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0377-2217(02)00136-4","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T10:10:42Z","timestamp":1035195042000},"page":"348-365","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":91,"title":["A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags"],"prefix":"10.1016","volume":"144","author":[{"given":"Roland","family":"Heilmann","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00136-4_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":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB2","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","article-title":"A branch and bound algorithm for the resource-constrained project scheduling problem","volume":"107","author":"Brucker","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: notation, classification, models, and methods","volume":"112","author":"Brucker","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the jop-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB5","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch and bound procedure for the multiple resource-constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB6","unstructured":"De Reyck, B., 1998. Scheduling projects with generalized precedence relations: Exact and heuristic procedures. Dissertation, Katholieke Universiteit Leuven, Belgium"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/S0377-2217(99)00151-4","article-title":"The multi-mode resource-constrained project scheduling problem with generalized precedence relations","volume":"119","author":"De Reyck","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB8","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","article-title":"A time-oriented branch-and-bound algorithm for project scheduling with generalised precedence constraints","volume":"46","author":"Dorndorf","year":"2000","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB9","series-title":"Activity Networks\u2014Project Planning and Control by Network Models","author":"Elmaghraby","year":"1977"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB10","unstructured":"Franck, B., 1999. Priorit\u00e4tsregelverfahren f\u00fcr die ressourcenbeschr\u00e4nkte Projektplanung mit und ohne Kalender. Doctoral Dissertation, Shaker, Aachen"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB11","unstructured":"Franck, B., Sch\u00e4fer, S., Seidel, K., 1998. Heuristiken f\u00fcr das multi-mode project scheduling problem. Working Paper, Institut f\u00fcr Wirtschaftstheorie und Operations Research, University of Karlsruhe"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB12","series-title":"Project Scheduling: Recent Models, Algorithms and Applications","first-page":"1","article-title":"A classification scheme for project scheduling","author":"Herroelen","year":"1999"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB13","series-title":"Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes","author":"Kolisch","year":"1995"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB14","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB15","series-title":"Project Scheduling: Recent Models, Algorithms and Applications","first-page":"179","article-title":"A heuristic for the multi-mode project scheduling problem based on Bender\u2019s decomposition","author":"Maniezzo","year":"1999"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB16","unstructured":"M\u00f6hring, R., Stork, F., Uetz, M., 1998. Resource constrained project scheduling with time windows: A branching scheme based on dynamic release dates. Arbeitspapier 596, Fachbereich Mathematik, Technical University of Berlin"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB17","series-title":"Operations Research","author":"Neumann","year":"1993"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB18","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s001860000092","article-title":"Active and stable project scheduling","volume":"52","author":"Neumann","year":"2000","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB19","first-page":"31","article-title":"Allocation of resources C.P.M","volume":"38","author":"Pascoe","year":"1966","journal-title":"Revue Fran\u00e7aise Recherche Op\u00e9rationnelle"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB20","unstructured":"Schwindt, C., 1998a. Verfahren zur L\u00f6sung des ressourcenbeschr\u00e4nkten Projektdauerminimierungsproblems mit planungsabh\u00e4ngigen Zeitfenstern. Doctoral Dissertation, Shaker, Aachen"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB21","unstructured":"Schwindt, C., 1998b. Generation of resource-constrained project scheduling problems subject to temporal constraints. Report WIOR-543, University of Karlsruhe"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB22","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0377-2217(94)90353-0","article-title":"DSS for multiobjective project scheduling","volume":"79","author":"S\u0142owi\u0144ski","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB23","series-title":"Resource-Constrained Project Scheduling\u2014Exact Methods for the Multi-Mode Case","author":"Sprecher","year":"1994"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB24","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","article-title":"Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm","volume":"107","author":"Sprecher","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01545587","article-title":"An exact algorithm for project scheduling with multiple modes","volume":"19","author":"Sprecher","year":"1997","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00136-4_BIB26","series-title":"Proceedings of the PMS Workshop, Istanbul","first-page":"137","article-title":"Multi-modal project scheduling with generalized precedence constraints","author":"Van Hove","year":"1998"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:54:00Z","timestamp":1759838040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702001364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0377221702001364"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00136-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0377-2217(02)00136-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}