{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:32:39Z","timestamp":1775028759978,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135194","type":"print"},{"value":"9783642135200","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_34","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"313-317","source":"Crossref","is-referenced-by-count":31,"title":["A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling"],"prefix":"10.1007","author":[{"given":"Timo","family":"Berthold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Heinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf H.","family":"M\u00f6hring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: Solving Constraint Integer Programs. Math. Programming Computation\u00a01, 1\u201341 (2009)","journal-title":"Math. Programming Computation"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Berthold, T.: Hybrid branching. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 309\u2013311. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-01929-6_23"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P., Pape, C.L.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints\u00a05, 119\u2013139 (2000)","journal-title":"Constraints"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., L\u00fcbbecke, M.E., M\u00f6hring, R.H., Schulz, J.: A constraint integer programming approach for resource-constrained project scheduling, ZIB-Report 10-03, Zuse Institute Berlin (2010)","DOI":"10.1007\/978-3-642-13520-0_34"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. B\u0142a\u017cewicz","year":"1983","unstructured":"B\u0142a\u017cewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math.\u00a05, 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"key":"34_CR6","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. (2009) (in press) (Corrected Proof)"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R. Klein","year":"1999","unstructured":"Klein, R., Scholl, A.: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. Eur. J. Oper. Res.\u00a0112, 322\u2013346 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"34_CR8","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. Manage. Sci.\u00a049, 330\u2013350 (2003)","journal-title":"Manage. Sci."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A.A.B. Pritsker","year":"1969","unstructured":"Pritsker, A.A.B., Watters, L.J., Wolfe, P.M.: Multi project scheduling with limited resources: A zero-one programming approach. Manage. Sci.\u00a016, 93\u2013108 (1969)","journal-title":"Manage. Sci."},{"key":"34_CR10","unstructured":"PSPLib, Project Scheduling P roblem LIBrary, http:\/\/129.187.106.231\/psplib\/ (last accessed 2010\/February\/01)"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1007\/978-3-642-04244-7_58","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"A. Schutt","year":"2009","unstructured":"Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Why cumulative decomposition is not as bad as it sounds. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 746\u2013761. Springer, Heidelberg (2009)"},{"key":"34_CR12","unstructured":"SCIP, Solving Constraint Integer Programs, http:\/\/scip.zib.de\/"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V. Valls","year":"2005","unstructured":"Valls, V., Ballest\u00edn, F., Quintanilla, S.: Justification and RCPSP: A technique that pays. Eur. J. Oper. Res.\u00a0165, 375\u2013386 (2005)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:14Z","timestamp":1606185554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}