{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T22:43:13Z","timestamp":1770331393710,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":[[1998,6]]},"DOI":"10.1016\/s0377-2217(97)00335-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"272-288","source":"Crossref","is-referenced-by-count":212,"title":["A branch and bound algorithm for the resource-constrained project scheduling problem"],"prefix":"10.1016","volume":"107","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arno","family":"Schoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olaf","family":"Thiele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00335-4_BIB1","unstructured":"Baar, T., Brucker, P., Knust, S., 1997. Tabu-search algorithms for the resource-constrained project scheduling problem, Osnabr\u00fccker Schriften zur Mathematik, Reihe P, Heft 192"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB2","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(97)00335-4_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/1520-6750(199002)37:1<61::AID-NAV3220370104>3.0.CO;2-S","article-title":"Solving resource-constrained project scheduling problems by A* search","volume":"37","author":"Bell","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling projects subject to resource constraints: Classification and complexity","volume":"5","author":"Bla\u017cewicz","year":"1983","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB5","doi-asserted-by":"crossref","unstructured":"Brucker, P., 1995. Scheduling algorithms, Springer, Berlin","DOI":"10.1007\/978-3-662-03088-2"},{"key":"10.1016\/S0377-2217(97)00335-4_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":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB7","unstructured":"Brucker, P., Schoo, A., Thiele, O., 1996. A branch and bound algorithm for the resource-constrained project scheduling problem, Osnabr\u00fccker Schriften zur Mathematik, Reihe P, Heft 178"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ro\/1991250303111","article-title":"Une m\u00e9thode arborescente pour r\u00e9soudre les probl\u00e8mes cumulatifs","volume":"25","author":"Carlier","year":"1991","journal-title":"RAIRO"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB9","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 Science"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB10","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)00335-4_BIB11","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)00335-4_BIB12","unstructured":"Demeulemeester, E., Herroelen, W., 1995. New benchmark results for the resource-constrained project scheduling problem, Paper presented at the INFORMS Singapore International 1995 Meeting"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB13","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0377-2217(94)90018-3","article-title":"On a paper by Christofides et al. for solving the multiple-resource constrained, simple project scheduling problem","volume":"76","author":"Demeulemeester","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB14","doi-asserted-by":"crossref","unstructured":"Gilmore, P.C., Gomory, R.E., 1961. A linear programming approach to the cutting-stock problem, OR 9, 849\u2013859","DOI":"10.1287\/opre.9.6.849"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB15","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C., 1980. Algorithmic graph theory and perfect graphs, Academic Press, New York","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB16","doi-asserted-by":"crossref","unstructured":"Johnson, R., 1988. Optimally balancing large assembly lines with FABLE, Management Science 34 (2) 240\u2013253","DOI":"10.1287\/mnsc.34.2.240"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB17","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB \u2013 A project scheduling problem library","volume":"96","author":"Kolisch","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB18","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)00335-4_BIB19","unstructured":"Korte, N., M\u00f6hring, R.H., 1985. Transitive orientation of graphs with side constraints. In: Noltemeier, H. (Ed.), Proceedings 11th International Workshop on Graph Theoretic Concepts in Computer Science WG '85, Trauner Verlag, Linz 1985, 143\u2013160"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB20","unstructured":"Kr\u00e4mer, A., 1995. Scheduling multiprocessor tasks on dedicated processors, Dissertation, Fachbereich Mathematik\/Informatik, Universit\u00e4t Osnabr\u00fcck"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB21","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L., 1994. An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation, Technical report no. 32, Department of Mathematics, University of Bologna, Italy"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB22","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., 1985. Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (Ed.), Graphs and Order: The Role of Graphs in the Theory of Ordered Sets and its Applications, NATO Advanced Science Institute Series, Series C., Mathematical and Physical Sciences, 41\u2013101","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB23","unstructured":"Papadimitriou, C.H., Steiglitz, K., 1982. Combinatorial optimization: Algorithms and complexity, Prentice-Hall, Englewood Cliffs, New Jersey"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB24","unstructured":"Schoo, A., 1996. Untere Schranken und Immediate Selection f\u00fcr das Resource-Constrained-Project Scheduling Problem, Diplomarbeit, Fachbereich Mathematik\/Informatik, Universit\u00e4t Osnabr\u00fcck"},{"key":"10.1016\/S0377-2217(97)00335-4_BIB25","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:S0377221797003354?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003354?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:04:33Z","timestamp":1579025073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0377221797003354"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00335-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}