{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:41:56Z","timestamp":1725514916366},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_10","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"127-140","source":"Crossref","is-referenced-by-count":1,"title":["Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"K\u00e9ri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling. Applying Constraint Programming to Scheduling Problems","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.P.M.: Constraint-Based Scheduling. Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Boston (2001)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"J.C. Beck","year":"2003","unstructured":"Beck, J.C., Refalo, P.: A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research\u00a0118, 49\u201371 (2003)","journal-title":"Annals of Operations Research"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Knust, S., Schoo, A., Thiele, O.: A branch and bound algorithm for the resource-constrained project scheduling problem. Eur.\u00a0J.\u00a0Oper.\u00a0Res.\u00a0107, 272\u2013288 (1998)","journal-title":"Eur.\u00a0J.\u00a0Oper.\u00a0Res."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E.L. Demeulemeester","year":"1992","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: A branch and bound procedure for the multiple resource constrained project scheduling problem. Management Sci.\u00a038, 1803\u20131818 (1992)","journal-title":"Management Sci."},{"key":"10_CR6","doi-asserted-by":"publisher","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.S.: A branch and bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Eur.\u00a0J.\u00a0Oper.\u00a0Res.\u00a0111, 152\u2013174 (1998)","journal-title":"Eur.\u00a0J.\u00a0Oper.\u00a0Res."},{"key":"10_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-57506-8","volume-title":"Project scheduling with time windows: From theory to applications","author":"U. Dorndorf","year":"2002","unstructured":"Dorndorf, U.: Project scheduling with time windows: From theory to applications. Physica-Verlag, Heidelberg (2002)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1287\/mnsc.42.10.1395","volume":"42","author":"O. Icmeli","year":"1996","unstructured":"Icmeli, O., Ereng\u00fc\u00e7, S.: A branch and bound procedure for the resource-constrained project scheduling problem with discounted cash flows. Management Sci.\u00a042, 1395\u20131408 (1996)","journal-title":"Management Sci."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"K\u00e9ri, A., Kis, T.: Primal-dual combined with constraint propagation for solving RCPSPWET. In: Kendall, G., Lei, L., Pinedo, M. (eds.) Proc. of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, New York University, New York, July 2005, (electronic edition), pp. 748\u2013751 (2005)","DOI":"10.1007\/0-387-27744-7"},{"key":"10_CR10","first-page":"685","volume-title":"Operation Research Proceedings","author":"A. K\u00e9ri","year":"2005","unstructured":"K\u00e9ri, A., Kis, T.: Primal-Dual combined with constraint propagation for solving RCPSPWET. In: Haasis, H.-D., Kopfer, H., Sch\u00f6nberger, J. (eds.) Operation Research Proceedings, Bremen, Germany, September 7-9, 2005, pp. 685\u2013690. Springer, Heidelberg (2005)"},{"key":"10_CR11","unstructured":"Khatib, L., Morris, P., Morris, R., Rossi, F.: Temporal Constraint Reasoning with Preferences. In: Proc.\u00a0Seventieth Int. Joint Conf.\u00a0Artif.\u00a0Intell.\u00a0(IJCAI\u201901), Seattle, USA, August 4-10, 2001, pp. 322\u2013327 (2001)"},{"key":"10_CR12","unstructured":"Kumar, T.K.S.: Fast (incremental) algorithms for useful classes of simple temporal problems with preferences. In: Proc.\u00a0Twentieth Int. Joint Conf.\u00a0Artif.\u00a0Intell.\u00a0(IJCAI\u201907), Hyderabad, India, January 6-12, 2007, pp. 1954\u20131959 (2007)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-540-30201-8_31","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Morris","year":"2004","unstructured":"Morris, P., Morris, R., Khatib, L., Ramakrishnan, S., Bachmann, A.: Strategies for Global Optimization of Temporal Preferences. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 408\u2013422. Springer, Heidelberg (2004)"},{"issue":"4","key":"10_CR14","first-page":"357","volume":"10","author":"K. Neumann","year":"2002","unstructured":"Neumann, K., Zimmermann, J.: Exact and truncated branch and bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Central Eur.\u00a0J.\u00a0of Oper.\u00a0Res.\u00a010(4), 357\u2013380 (2002)","journal-title":"Central Eur.\u00a0J.\u00a0of Oper.\u00a0Res."},{"key":"10_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, 2nd edn. Springer, Berlin (2003)","edition":"2"},{"key":"10_CR16","unstructured":"Nuijten, W.P.M.: Time and resource constrained scheduling: A constraint satisfaction approach. PhD Thesis, Eindhoven University of Technology (1994)"},{"key":"10_CR17","unstructured":"Schwindt, C.: ProGen\/max: A New Problem Generator for Different Resource-Constrained Project Scheduling Problems with Minimal and Maximal Time Lags. Technical report WIOR-449, University of Karlsruhe, Karlsruhe (1996), \n                  \n                    http:\/\/www.wior.uni-karlsruhe.de\/LS_Neumann\/Forschung\/ProGenMax\/rcpspmax.html"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/978-3-642-58300-1_62","volume-title":"Operations Research Proceedings 1999","author":"C. Schwindt","year":"2000","unstructured":"Schwindt, C.: Minimizing earliness-tardiness costs of resource constrained projects. In: Inderfurth, K., Schw\u00f6diauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., W\u00e4scher, G. (eds.) Operations Research Proceedings 1999, pp. 402\u2013407. Springer, Heidelberg (2000)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s001860100129","volume":"53","author":"C. Schwindt","year":"2001","unstructured":"Schwindt, C., Zimmermann, J.: A steepest ascent approach to maximizing the net present value of projects. Math.\u00a0Methods of Oper.\u00a0Res.\u00a053, 435\u2013450 (2001)","journal-title":"Math.\u00a0Methods of Oper.\u00a0Res."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1010958200070","volume":"102","author":"M. Vanhoucke","year":"2001","unstructured":"Vanhoucke, M., Demeulemeester, E.L., Herroelen, W.S.: An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Oper.\u00a0Res.\u00a0102, 179\u2013196 (2001)","journal-title":"Annals of Oper.\u00a0Res."},{"key":"10_CR21","unstructured":"Wennink, M.: Algorithmic support for automated planning boards. PhD Thesis, Eindhoven University of Technology (1995)"}],"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-540-72397-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:59:39Z","timestamp":1550386779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}