{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:38:51Z","timestamp":1759991931629},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00762-2","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"302-313","source":"Crossref","is-referenced-by-count":57,"title":["Lower bounds for resource-constrained project scheduling problems"],"prefix":"10.1016","volume":"149","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00762-2_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)00762-2_BIB2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0377-2217(95)00359-2","article-title":"A new and efficient heuristic for scheduling problems with resource restrictions and multiple execution modes","volume":"90","author":"Boctor","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB3","unstructured":"K. Bouleimen, H. Lecoque, A new efficient simulated annealing algorithm for the resource constrained project scheduling problem and its multiple mode version, Technical Report, University of Liege, 1998"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB4","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)00762-2_BIB5","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)00762-2_BIB6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(99)00489-0","article-title":"A linear programming and constraint propagation-based lower bound for the RCPSP","volume":"127","author":"Brucker","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB7","doi-asserted-by":"crossref","unstructured":"P. Brucker, S. Knust, Resource-constrained project scheduling and timetabling, in: E. Burke, W. Erben (Eds.), The Practice and Theory of Automated Timetabling III, Springer Lecture Notes in Computer Science, vol. 2079, 2001","DOI":"10.1007\/3-540-44629-X_17"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB8","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 Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB9","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)00762-2_BIB10","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)00762-2_BIB11","unstructured":"A. Fest, R.H. M\u00f6hring, F. Stork, M. Uetz, Resource-constrained project scheduling with time windows: A branching scheme based on dynamic release dates, Technical Report 596, Technische Universit\u00e4t Berlin, 1998"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB12","unstructured":"B. Franck, Priorit\u00e4tsregelverfahren f\u00fcr die ressourcenbeschr\u00e4nkte Projektplanung mit und ohne Kalender, Dissertation, Shaker, Aachen, 1999"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<283::AID-NET5>3.0.CO;2-I","article-title":"Project scheduling with multiple modes: a comparison of exact algorithms","volume":"32","author":"Hartmann","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB14","doi-asserted-by":"crossref","unstructured":"R. Heilmann, Ressourcenbeschr\u00e4nkte Projektplanung im Mehr-Modus-Fall, Dissertation, Deutscher Universit\u00e4tsverlag, Wiesbaden, 2000","DOI":"10.1007\/978-3-322-85194-9"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB15","unstructured":"R. Heilmann, C. Schwindt, Lower Bounds for RCPSP\/max, Report WIOR-511, Universit\u00e4t Karlsruhe, 1997"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB16","doi-asserted-by":"crossref","unstructured":"W. Herroelen, E. Demeulemeester, B. De Reyck, A classification scheme for project scheduling, in: J. W\u0229glarz (Ed.), Handbook on Recent Advances in Project Scheduling, Kluwer, 1998, pp. 197\u2013212","DOI":"10.1007\/978-1-4615-5533-9_1"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB17","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","article-title":"Computing lower bounds by destructive improvement\u2013\u2013an application to resource-constrained project scheduling","volume":"112","author":"Klein","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB18","series-title":"Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes","author":"Kolisch","year":"1995"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB19","series-title":"Handbook on Recent Advances in Project Scheduling","first-page":"197","article-title":"Benchmark instances for project scheduling problems","author":"Kolisch","year":"1998"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB20","series-title":"Handbook on Recent Advances in Project Scheduling","first-page":"179","article-title":"A heuristic for the multi-mode project scheduling problem based on Bender\u2019s decomposition","author":"Maniezzo","year":"1998"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB21","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","article-title":"An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation","volume":"44","author":"Mingozzi","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB22","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, A.S. Schulz, F. Stork, M. Uetz, Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems, in: J. Nesetril (Ed.), Proceedings of the 7th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1643, Springer, 1999, pp. 139\u2013150","DOI":"10.1007\/3-540-48481-7_13"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB23","series-title":"Essays and Surveys in Metaheuristics","first-page":"557","article-title":"Formulation and tabu search algorithm for the resource constrained project scheduling problem","author":"Nonobe","year":"2002"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB24","unstructured":"PSPLIB\u2013\u2013Project Scheduling Problem Library Kiel http:\/\/www.bwl.uni-kiel.de\/Prod\/psplib\/"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB25","unstructured":"PSPLIB\/max\u2013\u2013Project Scheduling Problem Library Karlsruhe http:\/\/www.wior.uni-karlsruhe.de\/RCPSPmax\/progenmax\/"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB26","unstructured":"C. Schwindt, Verfahren zur L\u00f6sung des ressourcenbeschr\u00e4nkten Projektdauerminimierungsproblems mit planungsabh\u00e4ngigen Zeitfenstern, Dissertation, Shaker, Aachen, 1998"},{"key":"10.1016\/S0377-2217(02)00762-2_BIB27","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"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007622?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007622?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T01:02:15Z","timestamp":1584666135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702007622"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00762-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}