{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:57Z","timestamp":1747548357435},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662518"},{"type":"electronic","value":"9783540484813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48481-7_13","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T19:49:40Z","timestamp":1193514580000},"page":"139-150","source":"Crossref","is-referenced-by-count":13,"title":["Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems"],"prefix":"10.1007","author":[{"given":"Rolf H.","family":"M\u00f6hring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Stork","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"M. Bartusch, R. H. M\u00f6hring, and F. J. Radermacher. Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16:201\u2013240, 1988.","journal-title":"Annals of Operations Research"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"P. Brucker, A. Drexl, R. H. M\u00f6hring, K. Neumann, and E. Pesch. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112:3\u201341, 1999.","journal-title":"European Journal of Operational Research"},{"key":"13_CR3","unstructured":"P. Brucker and S. Knust. A linear programming and constraint propagation-based lower bound for the RCPSP. Technical Report 204, Osnabr\u00fccker Schriften zur Mathematik, 1998."},{"key":"13_CR4","volume-title":"CORE Discussion Paper 9859","author":"C. C. B. Cavalcante","year":"1998","unstructured":"C. C. B. Cavalcante, C. C. De Souza, M. W. P. Savelsbergh, Y. Wang, and L. A. Wolsey. Scheduling projects with labor constraints. CORE Discussion Paper 9859, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1998."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/92.335014","volume":"2","author":"S. Chaudhuri","year":"1994","unstructured":"S. Chaudhuri, R. A. Walker, and J. E. Mitchell. Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2:456\u2013471, 1994.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"B. Cherkassky and A. V. Goldberg. On implementing push-relabel method for the maximum flow problem. In Proceedings of the 4th Conference on Integer Programming and Combinatorial Optimization, pages 157\u2013171, 1995.","DOI":"10.1007\/3-540-59408-6_49"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N. Christofides","year":"1987","unstructured":"N. Christofides, R. Alvarez-Valdes, and J. Tamarit. Project scheduling with resource constraints: A branch-and-bound approach. European Journal of Operational Research, 29:262\u2013273, 1987.","journal-title":"European Journal of Operational Research"},{"key":"13_CR8","unstructured":"A. Drexl and A. Kimms. Optimization guided lower and upper bounds for the Resource Investment Problem. Technical Report 481, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel, 1998."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM, 35:921\u2013940, 1988.","journal-title":"Journal of the ACM"},{"key":"13_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, NewYork, 1980."},{"key":"13_CR11","volume-title":"Business Optimisation using Mathematical Programming","author":"J. Kallrath","year":"1997","unstructured":"J. Kallrath and J. M. Wilson. Business Optimisation using Mathematical Programming. Macmillan Business, London, U.K., 1997."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R. Kolisch","year":"1996","unstructured":"R. Kolisch and A. Sprecher. PSPLIB-a project scheduling problem library. European Journal of Operational Research, 96:205\u2013216, 1996.","journal-title":"European Journal of Operational Research"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco. An exact algorithm for the multiple resource-constraint project scheduling problem based on a new mathematical formulation. Management Science, 44:714\u2013729, 1998.","journal-title":"Management Science"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"R. H. M\u00f6hring","year":"1984","unstructured":"R. H. M\u00f6hring. Minimizing costs of resource requirements subject to a fixed completion time in project networks. Operations Research, 32:89\u2013120, 1984.","journal-title":"Operations Research"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-94-009-5315-4_2","volume-title":"Graphs and Order","author":"R. H. M\u00f6hring","year":"1985","unstructured":"R. H. M\u00f6hring. Algorithmic aspects of comparability graphs and interval graphs. In I. Rival, editor, Graphs and Order, pages 41\u2013101. D. Reidel Publishing Company, Dordrecht, 1985."},{"key":"13_CR16","unstructured":"R. H. M\u00f6hring, A. S. Schulz, F. Sork, and M. Uetz. In preparation, 1999."},{"key":"13_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":"A. A. B. Pritsker, L. J. Watters, and P. M. Wolfe. Multi project scheduling with limited resources: A zero-one programming approach. Management Science, 16:93\u2013108, 1969.","journal-title":"Management Science"},{"key":"13_CR18","unstructured":"M. W. P. Savelsbergh, R. N. Uma, and J. Wein. An experimental study of LP-based approximation algorithms for scheduling problems. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 453\u2013462, 1998."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(96)00042-X","volume":"72","author":"M. Sch\u00e4ffter","year":"1997","unstructured":"M. Sch\u00e4ffter. Scheduling with respect to forbidden sets. Discrete Applied Mathematics, 72:141\u2013154, 1997.","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR20","series-title":"Technical Report","volume-title":"Generation of resource constrained project scheduling problems with minimal and maximal time lags","author":"C. Schwindt","year":"1996","unstructured":"C. Schwindt. Generation of resource constrained project scheduling problems with minimal and maximal time lags. Technical Report 489, WIOR, University of Karlsruhe, Germany, 1996."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48481-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T14:20:04Z","timestamp":1551018004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48481-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662518","9783540484813"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48481-7_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}