{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:13:10Z","timestamp":1780719190470,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"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":[[2000,12]]},"DOI":"10.1016\/s0377-2217(99)00489-0","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"355-362","source":"Crossref","is-referenced-by-count":76,"title":["A linear programming and constraint propagation-based lower bound for the RCPSP"],"prefix":"10.1016","volume":"127","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00489-0_BIB1","unstructured":"T. Baar, P. Brucker, S. Knust, Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem, in: S. Voss, S. Martello, I. Osman, C. Roucairol (Eds.), Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Dordrecht, 1998, pp. 1\u201318"},{"key":"10.1016\/S0377-2217(99)00489-0_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(99)00489-0_BIB3","unstructured":"E. Demeulemeester, Optimal algorithms for various classes of multiple resource-constrained project scheduling problem, Ph.D. thesis, Department of Applied Economic Sciences, Katholieke Universiteit Leuven, 1992"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB4","unstructured":"R. Heilmann, C. Schwindt, Lower Bounds for RCPSP\/max, Report WIOR-511, Universit\u00e4t Karlsruhe, 1997"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB5","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","article-title":"Computing lower bounds by destructive improvement \u2013 an application to resource-constrained project scheduling","volume":"112","author":"Klein","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB6","doi-asserted-by":"crossref","unstructured":"R. Kolisch, C. Schwindt, A. Sprecher, Benchmark instances for project scheduling problems, in: J. W\u0229glarz (Ed.), Handbook on Recent Advances in Project Scheduling, Kluwer, Dordrecht, 1998, pp. 197\u2013212","DOI":"10.1007\/978-1-4615-5533-9_9"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB7","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","article-title":"Characterization and generation of a general class of resource-constrained project scheduling problems","volume":"41","author":"Kolisch","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB \u2013 a project scheduling library","volume":"96","author":"Kolisch","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB9","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(99)00489-0_BIB10","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, A. Schulz, F. Stork, M. Uetz, Resource constrained project scheduling: computing lower bounds by solving minimum cut problems, Technical Report No. 620, TU Berlin, 1998","DOI":"10.1007\/3-540-48481-7_13"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB11","unstructured":"PSPLIB \u2013 Project Scheduling Problem Library Kiel http:\/\/www.bwl.uni-kiel.de\/Prod\/psplib\/"},{"key":"10.1016\/S0377-2217(99)00489-0_BIB12","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1080\/05695557808975212","article-title":"Multiple resource-constrained scheduling using branch and bound","volume":"10","author":"Stinson","year":"1978","journal-title":"AIIE Transactions"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004890?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004890?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T11:16:20Z","timestamp":1578741380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0377221799004890"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00489-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}