{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:27Z","timestamp":1759667307870},"reference-count":19,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1016\/s0305-0548(00)00048-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:21Z","timestamp":1027616841000},"page":"1387-1401","source":"Crossref","is-referenced-by-count":16,"title":["A high-performance exact method for the resource-constrained project scheduling problem"],"prefix":"10.1016","volume":"28","author":[{"given":"M.Reza","family":"Zamani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0305-0548(00)00048-4_BIB1","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1080\/07408179508936773","article-title":"A survey on the resource-constrained project scheduling problem","volume":"27","author":"Ozdamar","year":"1995","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(00)00048-4_BIB2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(96)00180-4","article-title":"A genetic algorithm for multi-mode resource constrained project scheduling problem","volume":"100","author":"Mori","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/S0305-0548(00)00048-4_BIB3","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/mnsc.17.12.B803","article-title":"An algorithm for optimal project scheduling under multiple resource constraint","volume":"17","author":"Davis","year":"1971","journal-title":"Management Science"},{"issue":"11","key":"10.1016\/S0305-0548(00)00048-4_BIB4","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"},{"issue":"3","key":"10.1016\/S0305-0548(00)00048-4_BIB5","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1080\/05695557808975212","article-title":"Multiple resourcer-constrained scheduling using branch and bound","volume":"10","author":"Stinson","year":"1978","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0305-0548(00)00048-4_BIB6","doi-asserted-by":"crossref","first-page":"280","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"},{"issue":"12","key":"10.1016\/S0305-0548(00)00048-4_BIB7","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch-and-bound procedure for multiple resource-constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Management Science"},{"issue":"8","key":"10.1016\/S0305-0548(00)00048-4_BIB8","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/0305-0548(95)00074-7","article-title":"Solving the resource constrained project scheduling problem with optimization subroutine library","volume":"23","author":"Icmeli","year":"1996","journal-title":"Journal of Computers and Operations Research"},{"issue":"11","key":"10.1016\/S0305-0548(00)00048-4_BIB9","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","article-title":"A new benchmark results for the resource-constrained project scheduling problem","volume":"43","author":"Demeulemeester","year":"1997","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00048-4_BIB10","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\/S0305-0548(00)00048-4_BIB11","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":"Reyck","year":"1998","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0305-0548(00)00048-4_BIB12","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1057\/palgrave.jors.2600546","article-title":"Solving project scheduling problems with heuristic learning algorithms","volume":"49","author":"Zamani","year":"1998","journal-title":"Journal of Operational Research Society"},{"issue":"2","key":"10.1016\/S0305-0548(00)00048-4_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","article-title":"Real-time heuristic search","volume":"42","author":"Korf","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0305-0548(00)00048-4_BIB14","series-title":"Principles of artificial intelligence","author":"Nillson","year":"1980"},{"issue":"2","key":"10.1016\/S0305-0548(00)00048-4_BIB15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/opre.18.2.263","article-title":"Solving resource-constrained network problems by implicit enumeration non-perceptive case","volume":"18","author":"Schrage","year":"1969","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0305-0548(00)00048-4_BIB16","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\/S0305-0548(00)00048-4_BIB17","unstructured":"Davis EW. An exact algorithm for multiple constrained resource project scheduling. Ph.D. dissertation, Yale University, USA, 1969."},{"issue":"8","key":"10.1016\/S0305-0548(00)00048-4_BIB18","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1287\/mnsc.21.8.944","article-title":"A comparison of heuristic and optimal solutions in resource-constrained project scheduling","volume":"21","author":"Davis","year":"1975","journal-title":"Management Science"},{"issue":"10","key":"10.1016\/S0305-0548(00)00048-4_BIB19","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"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000484?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000484?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:52:27Z","timestamp":1555768347000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":19,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S0305054800000484"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00048-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}