{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T03:25:07Z","timestamp":1773545107088,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131929","type":"print"},{"value":"9783642131936","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_20","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"226-238","source":"Crossref","is-referenced-by-count":5,"title":["A Branch-and-Price Algorithm for Multi-mode Resource Leveling"],"prefix":"10.1007","author":[{"given":"Eamonn T.","family":"Coughlan","sequence":"first","affiliation":[]},{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"20_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), 1\u201341 (2009)","journal-title":"Math. Programming Computation"},{"key":"20_CR2","unstructured":"Bianco, L., Caramia, M.: A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations. Computers and Operations Research (in press, 2009)"},{"key":"20_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 J. Oper. Res.\u00a0112, 3\u201341 (1999)","journal-title":"European J. Oper. Res."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0377-2217(99)00489-0","volume":"127","author":"P. Brucker","year":"2000","unstructured":"Brucker, P., Knust, S.: A linear programming and constraint propagation-based lower bound for the RCPSP. European J. Oper. Res.\u00a0127(2), 355\u2013362 (2000)","journal-title":"European J. Oper. Res."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1287\/mnsc.41.10.1590","volume":"41","author":"E. Demeulemeester","year":"1995","unstructured":"Demeulemeester, E.: Minimizing resource availability costs in time-limited project networks. Management Sci.\u00a041, 1590\u20131598 (1995)","journal-title":"Management Sci."},{"key":"20_CR6","volume-title":"Project Scheduling: A Research Handbook","author":"E.L. Demeulemeester","year":"2002","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling: A Research Handbook. Kluwer, Dordrecht (2002)"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1057\/palgrave.jors.2601099","volume":"52","author":"A. Drexl","year":"2001","unstructured":"Drexl, A., Kimms, A.: Optimization guided lower and upper bounds for the resource investment problem. The Journal of the Operational Research Society\u00a052(3), 340\u2013351 (2001)","journal-title":"The Journal of the Operational Research Society"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-387-25486-2_1","volume-title":"Column Generation","author":"J. Desrosiers","year":"2005","unstructured":"Desrosiers, J., L\u00fcbbecke, M.E.: A primer in column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 1\u201332. Springer, Berlin (2005)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/PL00013355","volume":"23","author":"B. Franck","year":"2001","unstructured":"Franck, B., Neumann, K., Schwindt, C.: Project scheduling with calendars. OR Spektrum\u00a023, 325\u2013334 (2001)","journal-title":"OR Spektrum"},{"issue":"1-4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1010902015091","volume":"102","author":"S. Hartmann","year":"2001","unstructured":"Hartmann, S.: Project scheduling with multiple modes: A genetic algorithm. Ann. Oper. Res.\u00a0102(1-4), 111\u2013135 (2001)","journal-title":"Ann. Oper. Res."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. European J. Oper. Res. (in press, 2009)","DOI":"10.1016\/j.ejor.2009.11.005"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Megow, N., M\u00f6hring, R.H., Schulz, J.: Decision support and optimization in shutdown and turnaround scheduling. INFORMS J. Computing (2010) (fourthcoming)","DOI":"10.1287\/ijoc.1100.0393"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H.: Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper. Res.\u00a032(1), 89\u2013120 (1984)","journal-title":"Oper. Res."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/ijoc.1070.0226","volume":"20","author":"L. Mercier","year":"2008","unstructured":"Mercier, L., Van Hentenryck, P.: Edge finding for cumulative scheduling. INFORMS J. Computing\u00a020(1), 143\u2013153 (2008)","journal-title":"INFORMS J. Computing"},{"key":"20_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project scheduling with time windows and scarce resources","author":"K. Neumann","year":"2003","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Project scheduling with time windows and scarce resources. Springer, Heidelberg (2003)"},{"key":"20_CR16","unstructured":"Project Scheduling Problem LIBrary, http:\/\/129.187.106.231\/psplib\/ (last accessed 2010\/02\/01)"},{"key":"20_CR17","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. Management Sci.\u00a016, 93\u2013108 (1969)","journal-title":"Management Sci."},{"key":"20_CR18","unstructured":"Solving Constraint Integer Programs, http:\/\/scip.zib.de\/"},{"issue":"5","key":"20_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF01415759","volume":"36","author":"J. Zhan","year":"1992","unstructured":"Zhan, J.: Calendarization of time planning in MPM networks. ZOR \u2013 Methods and Models for Oper. Res.\u00a036(5), 423\u2013438 (1992)","journal-title":"ZOR \u2013 Methods and Models for Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T19:50:23Z","timestamp":1635277823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}