{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:22:31Z","timestamp":1778692951555,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T00:00:00Z","timestamp":1346112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10951-012-0285-x","type":"journal-article","created":{"date-parts":[[2012,8,27]],"date-time":"2012-08-27T20:17:58Z","timestamp":1346098678000},"page":"273-289","source":"Crossref","is-referenced-by-count":47,"title":["Solving RCPSP\/max by lazy clause generation"],"prefix":"10.1007","volume":"16","author":[{"given":"Andreas","family":"Schutt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thibaut","family":"Feydy","sequence":"additional","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","published-online":{"date-parts":[[2012,8,28]]},"reference":[{"issue":"7","key":"285_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"key":"285_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10951-009-0125-9","volume":"14","author":"F. Ballest\u00edn","year":"2011","unstructured":"Ballest\u00edn, F., Barrios, A., & Valls, V. (2011). An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags. Journal of Scheduling, 14, 391\u2013406. doi: 10.1007\/s10951-009-0125-9 .","journal-title":"Journal of Scheduling"},{"issue":"1","key":"285_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., M\u00f6hring, R. H., & Radermacher, F. J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16(1), 199\u2013240.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"285_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87\u201390.","journal-title":"Quarterly of Applied Mathematics"},{"issue":"1","key":"285_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J.K., & Rinnooy Kan, A.H.G. (1983). Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics, 5(1), 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"285_CR6","doi-asserted-by":"crossref","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. (1999). Resource-constrained project scheduling: notation, classification, models, and methods. European Journal of Operational Research, 112(1), 3\u201341.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"285_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., & Smith, S. F. (2002). A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1), 109\u2013136.","journal-title":"Journal of Heuristics"},{"key":"285_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7, 201\u2013215.","journal-title":"Journal of the ACM"},{"issue":"7","key":"285_CR9","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem proving. Communications of the ACM, 5(7), 394\u2013397.","journal-title":"Communications of the ACM"},{"issue":"1","key":"285_CR10","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0377-2217(97)00305-6","volume":"111","author":"B. Reyck De","year":"1998","unstructured":"De Reyck, B., & Herroelen, W. (1998). A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research, 111(1), 152\u2013174.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"285_CR11","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","volume":"46","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000). A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Science, 46(10), 1365\u20131384.","journal-title":"Management Science"},{"key":"285_CR12","unstructured":"Fest, A., M\u00f6hring, R. H., Stork, F., & Uetz, M. (1999). Resource-constrained project scheduling with time windows: a branching scheme based on dynamic release dates (Technical Report 596). Technische Universit\u00e4t Berlin."},{"key":"285_CR13","unstructured":"Feydy, T. (2010). Constraint programming: improving propagation. PhD thesis, The University of Melbourne."},{"key":"285_CR14","first-page":"226","volume-title":"Proceedings of principles and practice of declarative programming\u2014PPDP 2008","author":"T. Feydy","year":"2008","unstructured":"Feydy, T., Schutt, A., & Stuckey, P. J. (2008). Global difference constraint propagation for finite domain solvers. In S. Antoy & E. Albert (Eds.), Proceedings of principles and practice of declarative programming\u2014PPDP 2008 (pp. 226\u2013235). New York: ACM"},{"key":"285_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/978-3-642-23786-7_23","volume-title":"Proceedings of principles and practice of constraint programming\u2014CP 2011","author":"T. Feydy","year":"2011","unstructured":"Feydy, T., Somogyi, Z., & Stuckey, P. J. (2011). Half reification and flattening. In J. H. M. Lee (Ed.), Lecture notes in computer science: Vol.\u00a06876. Proceedings of principles and practice of constraint programming\u2014CP 2011 (pp. 286\u2013301). Berlin: Springer."},{"key":"285_CR16","volume-title":"Flows in networks","author":"L. R. Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press."},{"issue":"3","key":"285_CR17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/PL00013356","volume":"23","author":"B. Franck","year":"2001","unstructured":"Franck, B., Neumann, K., & Schwindt, C. (2001). Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum, 23(3), 297\u2013324.","journal-title":"OR Spektrum"},{"issue":"4","key":"285_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","volume":"25","author":"W. Herroelen","year":"1998","unstructured":"Herroelen, W., De Reyck, B., & Demeulemeester, E. (1998). Resource-constrained project scheduling: a survey of recent developments. Computers & Operations Research, 25(4), 279\u2013302.","journal-title":"Computers & Operations Research"},{"key":"285_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10479-010-0693-2","volume":"181","author":"A. Horbach","year":"2010","unstructured":"Horbach, A. (2010). A boolean satisfiability approach to the resource-constrained project scheduling problem. Annals of Operations Research, 181, 89\u2013107.","journal-title":"Annals of Operations Research"},{"key":"285_CR20","first-page":"2318","volume-title":"Proceedings of artificial intelligence\u2014IJCAI 2007","author":"J. Huang","year":"2007","unstructured":"Huang, J. (2007). The effect of restarts on the efficiency of clause learning. In M. M. Veloso (Ed.), Proceedings of artificial intelligence\u2014IJCAI 2007 (pp. 2318\u20132323)."},{"key":"285_CR21","first-page":"197","volume-title":"Project scheduling: recent models, algorithms and applications","author":"R. Kolisch","year":"1998","unstructured":"Kolisch, R., Schwindt, C., & Sprecher, A. (1998). Publishers, chap benchmark instances for project scheduling problems. In Project scheduling: recent models, algorithms and applications (pp. 197\u2013212). Dordrecht: Kluwer Academic."},{"issue":"2","key":"285_CR22","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Le Pape","year":"1994","unstructured":"Le Pape, C. (1994). Implementation of resource constraints in ILOG Schedule: a library for the development of constraint-based scheduling systems. Intelligent Systems Engineering, 3(2), 55\u201366.","journal-title":"Intelligent Systems Engineering"},{"key":"285_CR23","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with constraints: an introduction","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., & Stuckey, P. J. (1998). Programming with constraints: an introduction. Cambridge: MIT Press."},{"key":"285_CR24","first-page":"530","volume-title":"Design automation conference","author":"M. W. Moskewicz","year":"2001","unstructured":"Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: engineering an efficient SAT solver. In Design automation conference (pp. 530\u2013535). New York: ACM."},{"key":"285_CR25","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01545589","volume":"19","author":"K. Neumann","year":"1997","unstructured":"Neumann, K., & Schwindt, C. (1997). Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum, 19, 205\u2013217.","journal-title":"OR Spektrum"},{"key":"285_CR26","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-642-03251-6_7","volume-title":"Recent advances in constraints","author":"A. Oddi","year":"2009","unstructured":"Oddi, A., & Rasconi, R. (2009). Iterative flattening search on RCPSP\/max problems: recent developments. In A. Oddi, F. Fages, & F. Rossi (Eds.), Lecture notes in computer science: Vol.\u00a05655. Recent advances in constraints (pp. 99\u2013115). Berlin: Springer."},{"issue":"3","key":"285_CR27","doi-asserted-by":"crossref","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. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357\u2013391.","journal-title":"Constraints"},{"key":"285_CR28","unstructured":"Project duration problem RCPSP\/max (2010). http:\/\/www.wior.uni-karlsruhe.de\/LS_Neumann\/Forschung\/ProGenMax\/rcpspmax.html ."},{"key":"285_CR29","unstructured":"PSPLib (2010). Project scheduling problem library. http:\/\/129.187.106.231\/psplib\/ ."},{"key":"285_CR30","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1007\/978-3-642-04244-7_58","volume-title":"Proceedings of principles and practice of constraint programming\u2014CP 2009","author":"A. Schutt","year":"2009","unstructured":"Schutt, A., Feydy, T., Stuckey, P. J., & Wallace, M. G. (2009). Why cumulative decomposition is not as bad as it sounds. In I. P. Gent (Ed.), Lecture notes in computer science: Vol.\u00a05732. Proceedings of principles and practice of constraint programming\u2014CP 2009 (pp. 746\u2013761). Berlin: Springer."},{"issue":"3","key":"285_CR31","doi-asserted-by":"crossref","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. (2011). Explaining the cumulative propagator. Constraints, 16(3), 250\u2013282.","journal-title":"Constraints"},{"key":"285_CR32","unstructured":"Schwindt, C. (1995). ProGen\/max: a new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags (WIOR\u00a0449). Universit\u00e4t Karlsruhe, Germany"},{"key":"285_CR33","unstructured":"Schwindt, C. (1998a). A branch-and-bound algorithm for the resource-constrained project duration problem subject to temporal constraints (WIOR\u00a0544). Universit\u00e4t Karlsruhe, Germany"},{"key":"285_CR34","volume-title":"Verfahren zur l\u00f6sung des ressourcenbeschr\u00e4nkten projektdauerminimierungsproblems mit planungsabh\u00e4ngigen zeitfenstern","author":"C. Schwindt","year":"1998","unstructured":"Schwindt, C. (1998b). Verfahren zur l\u00f6sung des ressourcenbeschr\u00e4nkten projektdauerminimierungsproblems mit planungsabh\u00e4ngigen zeitfenstern. Aachen: Shaker."},{"key":"285_CR35","first-page":"544","volume-title":"Proceedings of artificial intelligence\u2014AAAI 2004","author":"T. B. Smith","year":"2004","unstructured":"Smith, T. B., & Pyle, J. M. (2004). An effective algorithm for project scheduling with arbitrary temporal constraints. In D. L. McGuinness & G. Ferguson (Eds.), Proceedings of artificial intelligence\u2014AAAI 2004 (pp. 544\u2013549). Cambridge: AAAI Press\/MIT Press."},{"key":"285_CR36","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/11562931_3","volume-title":"Proceedings of logic programming\u2014ICLP 2005","author":"P. J. Stuckey","year":"2005","unstructured":"Stuckey, P. J., Garc\u00eda de la Banda, M. J., Maher, M. J., Marriott, K., Slaney, J. K., Somogyi, Z., Wallace, M. G., & Walsh, T. (2005). The G12 project: mapping solver independent models to efficient solutions. In M. Gabbrielli & G. Gupta (Eds.), Lecture notes in computer science: Vol.\u00a03668. Proceedings of logic programming\u2014ICLP 2005 (pp. 9\u201313). Berlin: Springer."},{"key":"285_CR37","volume-title":"Foundations of constraint satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E. (1993). Foundations of constraint satisfaction. San Diego: Academic Press."},{"key":"285_CR38","first-page":"1172","volume-title":"Proceedings of artificial intelligence\u2014IJCAI 1999","author":"T. Walsh","year":"1999","unstructured":"Walsh, T. (1999). Search in a small world. In Proceedings of artificial intelligence\u2014IJCAI 1999 (pp. 1172\u20131177). San Mateo: Morgan Kaufmann."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0285-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0285-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0285-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T04:45:24Z","timestamp":1562129124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0285-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,28]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["285"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0285-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,28]]}}}