{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T21:42:11Z","timestamp":1778622131626,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:00:00Z","timestamp":1183680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,10,12]]},"DOI":"10.1007\/s10479-007-0188-y","type":"journal-article","created":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:19:27Z","timestamp":1183681167000},"page":"25-36","source":"Crossref","is-referenced-by-count":28,"title":["A constraint programming approach for the resource-constrained project scheduling problem"],"prefix":"10.1007","volume":"157","author":[{"given":"Olivier","family":"Liess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,6]]},"reference":[{"key":"188_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00291-003-0155-1","volume":"26","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., & Demassey, S. (2004). Tight LP bounds for resources constrained project scheduling. OR Spectrum, 26, 251\u2013262.","journal-title":"OR Spectrum"},{"key":"188_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5, 119\u2013139.","journal-title":"Constraints"},{"key":"188_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-2217(99)00489-0","volume":"127","author":"P. Brucker","year":"2000","unstructured":"Brucker, P., & Knust, S. (2000). A Linear programming and constraint propagation for the RCPSP. European Journal of Operational Research, 127, 355\u2013362.","journal-title":"European Journal of Operational Research"},{"key":"188_CR4","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"127","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Knust, S., Schoo, A., & Thiele, O. (1998). A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 127, 272\u2013288.","journal-title":"European Journal of Operational Research"},{"key":"188_CR5","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., Moring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research, 112, 3\u201341.","journal-title":"European Journal of Operational Research"},{"key":"188_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1991","unstructured":"Carlier, J., & Pinson, E. (1991). A practical use of Jacson\u2019s preemptive schedule for solving the job-shop problem. European Journal of Operational Research, 78, 146\u2013161.","journal-title":"European Journal of Operational Research"},{"key":"188_CR7","doi-asserted-by":"crossref","unstructured":"Demassey, S., Artigues, C., & Michelon, P. (2005) Constraint propagation based cutting planes: an application to the resource-constrained project scheduling problem. INFORMS Journal on Computing (to appear).","DOI":"10.1287\/ijoc.1030.0043"},{"key":"188_CR8","doi-asserted-by":"crossref","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. (1997). New benchmark results for the resource-constrained project scheduling problem. Management Sciences, 43, 1485\u20131492.","journal-title":"Management Sciences"},{"key":"188_CR9","first-page":"213","volume-title":"Project scheduling\u2014recent models, algorithms and applications","author":"U. Dorndorf","year":"1999","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (1999). A survey of interval capacity consistency tests for time and resource constrained scheduling. In Project scheduling\u2014recent models, algorithms and applications (pp. 213\u2013238). Dordrecht: Kluwer Academic."},{"key":"188_CR10","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s001860000091","volume":"52","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000a). A branch and bound algorithm for the resource-constrained project scheduling problem. Mathematical Methods of Operations Research, 52, 413\u2013439.","journal-title":"Mathematical Methods of Operations Research"},{"key":"188_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0004-3702(00)00040-0","volume":"122","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000b). Constraint propagation techniques for disjunctive scheduling problems. Artif. Intell., 122, 189\u2013240.","journal-title":"Artif. Intell."},{"key":"188_CR12","unstructured":"Gondran, M., & Minoux, M. (1990) Graphes et algorithmes. Eyrolles."},{"key":"188_CR13","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R. Klein","year":"1999","unstructured":"Klein, R., & Scholl, A. (1999). Computing lower bounds by destructive improvement\u2014an application to RCPSP. European Journal of Operational Research, 112, 322\u2013346.","journal-title":"European Journal of Operational Research"},{"key":"188_CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R. Kolisch","year":"1996","unstructured":"Kolisch, R., & Sprecher, A. (1996). PSPLIB\u2014A project scheduling library. European Journal of Operational Research, 96, 205\u2013216.","journal-title":"European Journal of Operational Research"},{"key":"188_CR15","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, S., Ricciardelli, S., & Blanco, L. (1998). An exact algorithm for project scheduling with resource constraint based on a new mathematical formulation. Management Sciences, 44, 714\u2013729.","journal-title":"Management Sciences"},{"key":"188_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","volume":"31","author":"M. Palpant","year":"2004","unstructured":"Palpant, M., Artigues, C., & Michelon, P. (2004). LSSPER: a large neighborhood search for the resource-constrained project scheduling problem. Annals of Operations Research, 31, 237\u2013257. Special Issue on Metaheuristics.","journal-title":"Annals of Operations Research"},{"key":"188_CR17","first-page":"99","volume":"6","author":"J. Sankaran","year":"1999","unstructured":"Sankaran, J., Bricker, D., & Juang, S. (1999). A strong fractional cutting-plane algorithm for RCPSP. International Journal of Industrial Engineering, 6, 99\u2013111.","journal-title":"International Journal of Industrial Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0188-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0188-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0188-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:41Z","timestamp":1559153261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0188-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,6]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,10,12]]}},"alternative-id":["188"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0188-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,6]]}}}