{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:11:10Z","timestamp":1775275870376,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00442-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"322-346","source":"Crossref","is-referenced-by-count":96,"title":["Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling"],"prefix":"10.1016","volume":"112","author":[{"given":"Robert","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Scholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00442-6_BIB1","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdez, R., Tamarit, J.M., 1989. Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis, in: Slowinski, R., Weglarz, J. (Eds.), Advances in Project Scheduling, Elsevier, Amsterdam, pp. 113\u2013134","DOI":"10.1016\/B978-0-444-87358-3.50009-2"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB2","unstructured":"Balas, E., 1970. Project scheduling with resource constraints, in: Beale, E.M.L. (Ed.), Applications of Mathematical Programming Techniques, Elsevier, New York, pp. 187\u2013200"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(90)90116-S","article-title":"Some efficient multi-heuristic procedures for resource-constrained project scheduling","volume":"49","author":"Boctor","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB4","doi-asserted-by":"crossref","unstructured":"Brucker, P., Schoo, A., Thiele, O., 1996. A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research (to appear)","DOI":"10.1016\/0377-2217(95)00350-9"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB5","first-page":"311","article-title":"Une m\u00e9thode arborescente pour r\u00e9soudre les probl\u00e9mes cumulatifs","volume":"25","author":"Carlier","year":"1991","journal-title":"Recherche Op\u00e9rationelle"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","article-title":"Project scheduling with resource constraints: A branch and bound approach","volume":"29","author":"Christofides","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB7","doi-asserted-by":"crossref","unstructured":"Demeulemeester, E., 1992. Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems. Unpublished Ph.D. Thesis, Department of Applied Economic Sciences, Katholieke Universiteit Leuven","DOI":"10.1287\/mnsc.38.12.1803"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB8","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(97)00442-6_BIB9","doi-asserted-by":"crossref","unstructured":"Demeulemeester, E., Herroelen, W., 1997. New benchmark results for the resource-constrained project scheduling problem. Management Science 43, 1485\u20131492","DOI":"10.1287\/mnsc.43.11.1485"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0377-2217(94)00344-0","article-title":"On the use of the complexity index as a measure of complexity in activity networks","volume":"91","author":"De Reyck","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB11","unstructured":"De Reyck, B., Herroelen, W., 1996b. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations, Research Report No. 9613, Department of Applied Economic Sciences, Katholieke Universiteit Leuven"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB13","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1287\/opre.21.5.1114","article-title":"Optimal solution of scheduling problems using Lagrange multipliers: Part I","volume":"21","author":"Fisher","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB14","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","article-title":"Serial and parallel resource-constrained project scheduling methods revisited \u2013 Theory and computation","volume":"90","author":"Kolisch","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB15","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(97)00442-6_BIB16","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L., 1995. An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science (to appear)"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB17","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/mnsc.30.7.854","article-title":"A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem","volume":"30","author":"Patterson","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB18","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","article-title":"BISON: A fast hybrid procedure for solving the one-dimensional bin packing problem","volume":"24","author":"Scholl","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB19","unstructured":"Sprecher, A., 1996. Solving the RCPSP efficiently at modest memory requirements. Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel, No. 425"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB20","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"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB21","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1287\/mnsc.24.11.1163","article-title":"An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems","volume":"24","author":"Talbot","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB22","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1057\/palgrave.jors.2600318","article-title":"An investigation into the relationship of heuristic performance with network-resource characteristics","volume":"48","author":"Thomas","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00442-6_BIB23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/355744.355755","article-title":"ALGORITHM 520: An automatic revised Simplex method for constrained resource network scheduling","volume":"3","author":"Weglarz","year":"1977","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004426?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004426?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T18:03:35Z","timestamp":1579025015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797004426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221797004426"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00442-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}