{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:25:30Z","timestamp":1766136330487,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_24","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"362-378","source":"Crossref","is-referenced-by-count":20,"title":["Maximising the Net Present Value for Resource-Constrained Project Scheduling"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Schutt","sequence":"first","affiliation":[]},{"given":"Geoffrey","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]},{"given":"Mark G.","family":"Wallace","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"24_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"Mathematical and Computer Modelling"},{"key":"24_CR2","unstructured":"Beringer, H., De Backer, B.: Satisfiability of boolean formulas over linear constraints. In: IJCAI, pp. 296\u2013304 (1993)"},{"issue":"1","key":"24_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"},{"issue":"12","key":"24_CR4","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":"24_CR5","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":"24_CR6","unstructured":"Demeulemeester, E.L., Herroelen, W.S., Van\u00a0Dommelen, P.: An optimal recursive search procedure for the deterministic unconstrained max-npv project scheduling problem. Tech. rep., Katholieke Universiteit Leuven (1996), Research Report 9603"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/nav.3800190110","volume":"19","author":"R.C. Grinold","year":"1972","unstructured":"Grinold, R.C.: The payment scheduling problem. Naval Research Logistics Quarterly\u00a019(1), 123\u2013136 (1972)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"24_CR8","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"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1022323717928","volume":"8","author":"W. Harvey","year":"2003","unstructured":"Harvey, W., Stuckey, P.J.: Improving linear constraint propagation by changing constraint representation. Constraints\u00a08(2), 173\u2013207 (2003)","journal-title":"Constraints"},{"key":"24_CR10","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":"24_CR11","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"},{"issue":"8","key":"24_CR12","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1016\/j.autcon.2008.04.006","volume":"17","author":"S.-S. Liu","year":"2008","unstructured":"Liu, S.-S., Wang, C.-J.: Resource-constrained construction project scheduling model for profit maximization considering cash flow. Automation in Construction\u00a017(8), 966\u2013974 (2008)","journal-title":"Automation in Construction"},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Inf. Proc. Let.\u00a047(4), 173 (1993)","journal-title":"Inf. Proc. Let."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Procs. of DAC 2001, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"issue":"4","key":"24_CR15","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"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"issue":"5","key":"24_CR17","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"},{"issue":"1","key":"24_CR18","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C. Schulte","year":"2008","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems\u00a031(1), Article No. 2 (2008)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/11564751_71","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C. Schulte","year":"2005","unstructured":"Schulte, C., Tack, G.: Views and Iterators for Generic Constraint Implementations. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 817\u2013821. Springer, Heidelberg (2005)"},{"key":"24_CR20","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving the resource constrained project scheduling problem with generalized precedences by lazy clause generation (September 2010), \n                  \n                    http:\/\/arxiv.org\/abs\/1009.0347"},{"issue":"3","key":"24_CR21","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A. Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints\u00a016(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s001860100129","volume":"53","author":"C. Schwindt","year":"2001","unstructured":"Schwindt, C., Zimmermann, J.: A steepest ascent approach to maximizing the net present value of projects. Mathematical Methods of Operations Research\u00a053, 435\u2013450 (2001)","journal-title":"Mathematical Methods of Operations Research"},{"issue":"2","key":"24_CR23","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/nav.10052","volume":"50","author":"T. Selle","year":"2003","unstructured":"Selle, T., Zimmermann, J.: A bidirectional heuristic for maximizing the net present value of large-scale projects subject to limited resources. Naval Research Logistics (NRL)\u00a050(2), 130\u2013148 (2003)","journal-title":"Naval Research Logistics (NRL)"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998), \n                  \n                    http:\/\/dx.doi.org\/10.1007\/3-540-49481-2_30"},{"key":"24_CR25","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"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:43Z","timestamp":1620127063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}