{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:36Z","timestamp":1740098916836,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335570"},{"type":"electronic","value":"9783642335587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_55","type":"book-chapter","created":{"date-parts":[[2012,10,2]],"date-time":"2012-10-02T22:32:47Z","timestamp":1349217167000},"page":"767-781","source":"Crossref","is-referenced-by-count":5,"title":["Maximising the Net Present Value of Large Resource-Constrained Projects"],"prefix":"10.1007","author":[{"given":"Hanyu","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark G.","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","unstructured":"Boost.org, http:\/\/www.boost.org\/"},{"key":"55_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0272-6963(96)00005-8","volume":"14","author":"S. Baroum","year":"1996","unstructured":"Baroum, S., Patterson, J.: The development of cash flow weight procedures for maximizing the net present value of a project. Journal of Operations Management\u00a014, 209\u2013227 (1996)","journal-title":"Journal of Operations Management"},{"issue":"1","key":"55_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research\u00a0112(1), 3\u201341 (1999)","journal-title":"European Journal of Operational Research"},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/92.335014","volume":"2","author":"S. Chaudhuri","year":"1994","unstructured":"Chaudhuri, S., Walker, R., Mitchell, J.: Analyzing and exploiting the structure of the constraints in the ilp approach to the scheduling problem. IEEE Trans. Very Large Scale Integration (VLSI) Systems\u00a02, 456\u2013471 (1994)","journal-title":"IEEE Trans. Very Large Scale Integration (VLSI) Systems"},{"key":"55_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-59408-6_49","volume-title":"Integer Programming and Combinatorial Optimization","author":"Boris V. Cherkassky","year":"1995","unstructured":"Cherkassky, B., Goldberg, A.: On implementing push-relabel method for the maximum flow problem. In: IPCO 1995, pp. 157\u2013171 (1995)"},{"issue":"12","key":"55_CR6","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E.L. Demeulemeester","year":"1992","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science\u00a038(12), 1803\u20131818 (1992)","journal-title":"Management Science"},{"issue":"11","key":"55_CR7","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","volume":"43","author":"E.L. Demeulemeester","year":"1997","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: New benchmark results for the resource-constrained project scheduling problem. Management Science\u00a043(11), 1485\u20131492 (1997)","journal-title":"Management Science"},{"key":"55_CR8","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1287\/mnsc.23.8.882","volume":"23","author":"R. Doersch","year":"1977","unstructured":"Doersch, R., Patterson, J.: Scheduling a project to maximize its present value: A zero-one programming approach. Management Science\u00a023, 882\u2013889 (1977)","journal-title":"Management Science"},{"key":"55_CR9","first-page":"207","volume":"47","author":"G. D\u00f3sa","year":"2004","unstructured":"D\u00f3sa, G.: Graham\u2019s example is the only tight one for P||C max . Annales Universitatis Scientarium Budapestiensis de Rolando E\u00f6t\u00f6s nominatae, Sectio Mathematica\u00a047, 207\u2013210 (2004)","journal-title":"Annales Universitatis Scientarium Budapestiensis de Rolando E\u00f6t\u00f6s nominatae, Sectio Mathematica"},{"key":"55_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M. Fisher","year":"1981","unstructured":"Fisher, M.: The lagrangian relaxation method for solving integer programming problems. Management Science\u00a027, 1\u201318 (1981)","journal-title":"Management Science"},{"issue":"9","key":"55_CR11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Tech. J.\u00a0(45), 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"55_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S. Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research\u00a0207(1), 1\u201314 (2010)","journal-title":"European Journal of Operational Research"},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"Herroelen, W.S., Demeulemeester, E.L., De Reyck, B.: A classification scheme for project scheduling. In: Weglarz, J. (ed.) Project Scheduling. International Series in Operations Research and Management Science, vol.\u00a014, pp. 1\u201326. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4615-5533-9_1"},{"issue":"10","key":"55_CR14","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1287\/mnsc.42.10.1395","volume":"42","author":"O. Icmeli","year":"1996","unstructured":"Icmeli, O., Ereng\u00fc\u00e7, S.S.: A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows. Management Science\u00a042(10), 1395\u20131408 (1996)","journal-title":"Management Science"},{"key":"55_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E. Johnson","year":"1993","unstructured":"Johnson, E., Mehrotra, A., Nemhauser, G.: Min-cut clustering. Mathematical Programming\u00a062, 133\u2013151 (1993)","journal-title":"Mathematical Programming"},{"key":"55_CR16","unstructured":"Karypis, G.: METIS, A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Version 5.0 (2011), http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis"},{"key":"55_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1010962300979","volume":"102","author":"A. Kimms","year":"2001","unstructured":"Kimms, A.: Maximizing the net present value of a project under resource constraints using a lagrangian relaxation based heuristic with tight upper bounds. Annals of Operations Research\u00a0102, 221\u2013236 (2001)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"55_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"R.H. M\u00f6hring","year":"2003","unstructured":"M\u00f6hring, R.H., Schulz, A.S., Stork, F., Uetz, M.: Solving project scheduling problems by minimum cut computations. Management Science\u00a049(3), 330\u2013350 (2003)","journal-title":"Management Science"},{"issue":"4","key":"55_CR19","first-page":"357","volume":"10","author":"K. Neumann","year":"2002","unstructured":"Neumann, K., Zimmermann, J.: Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Central European Journal of Operations Research\u00a010(4), 357\u2013380 (2002)","journal-title":"Central European Journal of Operations Research"},{"key":"55_CR20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/(SICI)1520-6750(199706)44:4<365::AID-NAV6>3.0.CO;2-4","volume":"44","author":"R. Padman","year":"1997","unstructured":"Padman, R., Smith-Daniels, D.E., Smith-Daniels, V.L.: Heuristic scheduling of resource-constrained projects with cash flows. Naval Research Logistics\u00a044, 365\u2013381 (1997)","journal-title":"Naval Research Logistics"},{"issue":"5","key":"55_CR21","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1287\/mnsc.16.5.357","volume":"16","author":"A.H. Russell","year":"1970","unstructured":"Russell, A.H.: Cash flows in networks. Management Science\u00a016(5), 357\u2013373 (1970)","journal-title":"Management Science"},{"key":"55_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-29828-8_24","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"A. Schutt","year":"2012","unstructured":"Schutt, A., Chu, G., Stuckey, P.J., Wallace, M.G.: Maximising the Net Present Value for Resource-Constrained Project Scheduling. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 362\u2013378. Springer, Heidelberg (2012)"},{"key":"55_CR23","unstructured":"Siek, J.G., Lee, L.Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley (2001)"},{"key":"55_CR24","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1287\/mnsc.47.8.1113.10226","volume":"47","author":"M. Vanhoucke","year":"2001","unstructured":"Vanhoucke, M., Demeulemeester, E.L., Herroelen, W.S.: On maximizing the net present value of a project under renewable resource constraints. Management Science\u00a047, 1113\u20131121 (2001)","journal-title":"Management Science"},{"key":"55_CR25","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/A:1014839227049","volume":"113","author":"X. Zhao","year":"2002","unstructured":"Zhao, X., Luh, P.B.: New bundle methods for solving lagrangian relaxation dual problems. J. Optim. Theory Appl.\u00a0113, 373\u2013397 (2002), http:\/\/dx.doi.org\/10.1023\/A:1014839227049","journal-title":"J. Optim. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T07:01:50Z","timestamp":1562223710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}