{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T15:04:12Z","timestamp":1783695852448,"version":"3.55.0"},"reference-count":203,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0377-2217(98)00204-5","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"3-41","source":"Crossref","is-referenced-by-count":1099,"title":["Resource-constrained project scheduling: Notation, classification, models, and methods"],"prefix":"10.1016","volume":"112","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Drexl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"M\u00f6hring","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00204-5_BIB1","unstructured":"T. Ahn, S.S. Ereng\u00fcc, Resource constrained project scheduling problem with multiple crashable modes, Technical Report, College of Business Administration, University of Florida, Gainesville, USA, 1995"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB2","unstructured":"H.N. Ahuja, Construction Performance Control by Networks, Wiley, New York, 1976"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB3","unstructured":"C. Akkan, Two heuristics based on a graph induction method for the discrete time\u2013cost tradeoff problem, Working Paper, Ko\u00e7 University, Istanbul, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB4","unstructured":"R. Alvarez-Valdes, J.M. Tamarit, Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis, in: R. S\u0142owi\u0144ski, J. W\u0229glarz (Eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989, pp. 114\u2013134"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB5","unstructured":"T. Baar, P. Brucker, S. Knust, Tabu-search algorithms for the resource-constrained project scheduling problem, Working Paper, Universit\u00e4t Osnabr\u00fcck, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB6","doi-asserted-by":"crossref","unstructured":"M.O. Ball, C.J. Colbourn, J.S. Provan, Network reliability, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Models, Handbooks in Operations Research and Management Science, vol. 8, Elsevier, Amsterdam, 1995, pp. 673\u2013762","DOI":"10.1016\/S0927-0507(05)80128-8"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB7","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0377-2217(94)90380-8","article-title":"Optimal resource leveling using non-serial dynamic programming","volume":"78","author":"Bandelloni","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB8","unstructured":"P. Baptiste, C. Le Pape, A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), Montreal, Canada, 1995"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB9","unstructured":"P. Baptiste, C. Le Pape, W.P.M. Nuijten, Constrained-based optimization and approximation for job-shop scheduling, Proceedings of the AAAI\u2013SIGMAN Workshop on Intelligent Manufacturing Systems, 14th International Joint Conference on Artificial Intelligence (IJCAI), Montreal, Canada, 1995"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB10","unstructured":"P. Baptiste, C. Le Pape, W.P.M. Nuijten, Incorporating efficient operations research algorithms in constrained-based scheduling, Proceedings of the First Joint Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, Oregon, to appear"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB11","unstructured":"P. Baptiste, C. Le Pape, W.P.M. Nuijten, Satisfiability test and time-bound adjustments for cumulative scheduling problems, Working Paper, Universit\u00e9 de Technologie de Compi\u00e8gne, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","article-title":"Scheduling project networks with resource constraints and time windows","volume":"16","author":"Bartusch","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB13","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1137\/0221065","article-title":"Optimal reduction of two-terminal directed acyclic graphs","volume":"21","author":"Bein","year":"1992","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/1520-6750(199106)38:3<315::AID-NAV3220380304>3.0.CO;2-7","article-title":"A new heuristic solution method in resource-constrained project scheduling","volume":"38","author":"Bell","year":"1991","journal-title":"Naval Research Logistic"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB15","first-page":"274","article-title":"Time\u2013cost optimization","volume":"27","author":"Billstein","year":"1977","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB16","doi-asserted-by":"crossref","unstructured":"J. Bla\u017cewicz, W. Domschke, E. Pesch, The job shop scheduling problem: Conventional and new solution techniques, European Journal of Operational Research 93 (1996) 1\u201333","DOI":"10.1016\/0377-2217(95)00362-2"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB17","doi-asserted-by":"crossref","unstructured":"J. Bla\u017cewicz, K.H. Ecker, E. Pesch, G. Schmidt, J. W\u0229glarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin, 1996","DOI":"10.1007\/978-3-662-03217-6"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB18","doi-asserted-by":"crossref","unstructured":"J. Bla\u017cewicz, J.K. Lenstra, A.H.G. Rinnooy Kan, Scheduling subject to resource constraints, Discrete Applied Mathematics 5 (1983) 11\u201324","DOI":"10.1016\/0166-218X(83)90012-4"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB19","unstructured":"J. Bla\u017cewicz, E. Pesch, M. Sterna, A note on disjunctive graph representation, Working Paper, Universit\u00e4t Bonn, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB20","doi-asserted-by":"crossref","unstructured":"J. Bla\u017cewicz, E. Pesch, M. Sterna, A branch and bound algorithm for the job shop scheduling problem, in: A. Drexl, A. Kimms (Eds.), Beyond Manufacturing Resource Planning (MRP II) \u2013 Advanced Models and Methods for Production Planning, Springer, Berlin, 1998, pp. 219\u2013244","DOI":"10.1007\/978-3-662-03742-3_9"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB21","doi-asserted-by":"crossref","unstructured":"J. B\u00f6ttcher, A. Drexl, R. Kolisch, F. Salewski, Project scheduling under partially renewable resource constraints, Management Science, under review","DOI":"10.1287\/mnsc.45.4.543"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(90)90116-S","article-title":"Some efficient multi-heuristic procedures for resource-constrained project scheduling","volume":"49","author":"Boctor","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0377-2217(95)00359-2","article-title":"A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes","volume":"90","author":"Boctor","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB24","unstructured":"K. Bouleimen, H. Lecocq, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem, Technical Report, Service de Robotique et Automatisation, Universit\u00e9 de Li\u00e8ge, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB25","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02136842","article-title":"Stochastic gradient-based time\u2013cost tradeoffs in PERT networks using simulation","volume":"53","author":"Bowman","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB26","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/12460125.1996.10511678","article-title":"Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: The resource-leveling and minimum project duration problems","volume":"5","author":"Brinkmann","year":"1996","journal-title":"Journal of Decision Systems"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB27","doi-asserted-by":"crossref","unstructured":"P. Brucker, Scheduling Algorithms, Springer, Berlin, 2nd edition, 1998","DOI":"10.1007\/978-3-662-03612-9"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB28","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(93)90174-L","article-title":"A new lower bound for the job-shop scheduling problem","volume":"64","author":"Brucker","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB29","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02085636","article-title":"The job-shop problem and immediate selection","volume":"50","author":"Brucker","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB30","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A branch and bound algorithm for the job-shop problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB31","doi-asserted-by":"crossref","unstructured":"P. Brucker, S. Knust, Solving large-sized resource\u2013constrained project scheduling problems; in: J. W\u0229glarz (Ed.), Handbook on Recent Advances in Project Scheduling, Kluwer Academic Publishers, Dordrecht, to appear","DOI":"10.1007\/978-1-4615-5533-9_2"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB32","doi-asserted-by":"crossref","unstructured":"P. Brucker, S. Knust, A. Schoo, O. Thiele, A branch and bound algorithm for the resource-constrained project scheduling problem, European Journal of Operational Research, 107 (1998) 272\u2013288","DOI":"10.1016\/S0377-2217(97)00335-4"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB33","first-page":"76","article-title":"Variation in activity level on a cyclical arrow diagram","volume":"13","author":"Burgess","year":"1962","journal-title":"Journal of Industrial Engineering"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB34","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/mnsc.18.3.207","article-title":"Contitional Monte Carlo: A simulation technique for stochastic network analysis","volume":"18","author":"Burt","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB35","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB36","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB37","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson's preemptive schedule for solving the job shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB38","unstructured":"Y. Caseau, F. Laburthe, Disjunctive scheduling with task intervals, Working Paper, Ecole Normale Sup\u00e9rieure Paris, 1995"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB39","unstructured":"Y. Caseau, F. Laburthe, Cumulative scheduling with task intervals, Proceedings of the Joint Internal Conference and Symposium on Logic Programming, 1996"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB40","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","article-title":"Project scheduling with resource constraints: A branch and bound approach","volume":"29","author":"Christofides","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB41","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/mnsc.17.12.B803","article-title":"An algorithm for optimal project scheduling under multiple resource constraints","volume":"17","author":"Davis","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB42","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1287\/mnsc.21.8.944","article-title":"A comparison of heuristic and optimum solutions in resource-constrained project scheduling","volume":"21","author":"Davis","year":"1975","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB43","unstructured":"N. Dayanand, R. Padman, Payments in projects: A contractor's model, Working Paper, The Heinz School, Carnegie Mellon University, Pittsburgh, 1993"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB44","unstructured":"N. Dayanand, R. Padman, Project contracts and payment schedules: The client's problem, Working Paper, The Heinz School, Carnegie Mellon University, Pittsburgh, 1996"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB45","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(94)00187-H","article-title":"The discrete time\u2013cost tradeoff problem revisited","volume":"81","author":"De","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB46","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/opre.45.2.302","article-title":"Complexity of the discrete time\u2013cost tradeoff problem for project networks","volume":"45","author":"De","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB47","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1287\/mnsc.41.10.1590","article-title":"Minimizing resource availability costs in time-limited project networks","volume":"41","author":"Demeulemeester","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB48","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch-and-bound procedure for the multiple resource-constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB49","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","article-title":"New benchmark results for the resource-constrained project scheduling problem","volume":"43","author":"Demeulemeester","year":"1997","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB50","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0377-2217(94)00181-2","article-title":"Optimal procedures for the discrete time\/cost trade-off problem in project networks","volume":"88","author":"Demeulemeester","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB51","doi-asserted-by":"crossref","unstructured":"B. De Reyck, Scheduling projects with generalized precedence relations: Exact and heuristic procedures, Ph.D. Dissertation, Katholieke Universiteit Leuven, 1998","DOI":"10.1007\/978-1-4615-5533-9_4"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB52","doi-asserted-by":"crossref","unstructured":"B. De Reyck, E. Demeulemeester, W. Herroelen, Local search methods for the discrete time\/resource trade-off problem in project networks, Technical Report, Department of Applied Economics, Katholieke Universiteit Leuven, 1997","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<553::AID-NAV2>3.0.CO;2-1"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB53","unstructured":"B. De Reyck, W. Herroelen, The multi-mode resource-constrained project scheduling problem with generalized precedence constraints, Working Paper, Katholieke Universiteit Leuven, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB54","doi-asserted-by":"crossref","unstructured":"B. De Reyck, W. Herroelen, A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations, European Journal of Operational Research, to appear","DOI":"10.1016\/S0377-2217(97)00305-6"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB55","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.4.4.441","article-title":"Inequalities for the completion times of stochastic PERT networks","volume":"4","author":"Devroye","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB56","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.33.4.862","article-title":"Bounding the project completion time distribution in PERT networks","volume":"33","author":"Dodin","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB57","unstructured":"U. Dorndorf, E. Pesch, T. Phan Huy, A time-oriented branch-and-bound algorithm for project scheduling with generalized precedence constraints, Working Paper, Universit\u00e4t Bonn, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB58","doi-asserted-by":"crossref","unstructured":"U. Dorndorf, T. Phan Huy, E. Pesch, A survey of interval capacity consistency tests for time- and resource-constrained scheduling, in: J. W\u0229glarz (Ed.), Handbook on Recent Advances in Project Scheduling, Kluwer Academic Publishers, Dordrecht, 1998, to appear","DOI":"10.1007\/978-1-4615-5533-9_10"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB59","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0167-6377(90)90018-Z","article-title":"Distribution-free bounds on the expectation of the maximum with scheduling applications","volume":"9","author":"Downey","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB60","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1287\/mnsc.37.12.1590","article-title":"Scheduling of project networks by job assignment","volume":"37","author":"Drexl","year":"1991","journal-title":"Management Science"},{"issue":"5","key":"10.1016\/S0377-2217(98)00204-5_BIB61","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1080\/07408179308964317","article-title":"Nonpreemptive multi-mode resource-constrained project scheduling","volume":"25","author":"Drexl","year":"1993","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB62","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1061\/(ASCE)0733-9364(1989)115:2(302)","article-title":"Resource leveling in construction by optimization","volume":"115","author":"Easa","year":"1989","journal-title":"Journal of Construction Engineering and Management"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB63","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/mnsc.13.5.299","article-title":"On the expected duration of PERT type networks","volume":"13","author":"Elmaghraby","year":"1967","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB64","unstructured":"S.E. Elmaghraby, Activity Networks \u2013 Project Planning and Control by Network Models, Wiley, New York, 1977"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB65","doi-asserted-by":"crossref","unstructured":"S.E. Elmaghraby, The estimation of some network parameters in the PERT model of activity networks: Review and critique, in: R. Slowi\u0144ski, J. W\u0229glarz, (Eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989, pp. 371\u2013432","DOI":"10.1016\/B978-0-444-87358-3.50021-3"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB66","first-page":"50","article-title":"Resource allocation via dynamic programming in activity networks","volume":"88","author":"Elmaghraby","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB67","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(94)00184-E","article-title":"Activity nets: a guided tour through some recent developments","volume":"82","author":"Elmaghraby","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB68","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0377-2217(90)90118-U","article-title":"The scheduling of activities to maximize the net present value of projects","volume":"49","author":"Elmaghraby","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB69","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/0377-2217(93)90183-N","article-title":"PERT and crashing revisited: Mathematical generalizations","volume":"64","author":"Foldes","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB70","unstructured":"B. Franck, K. Neumann, Resource-constrained project scheduling with time windows \u2013 structural questions and priority-rule methods, Report WIOR-492, Universit\u00e4t Karlsruhe, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB71","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/net.3230010105","article-title":"Optimal design of centralized computer networks","volume":"1","author":"Frank","year":"1970","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB72","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition of backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB73","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","article-title":"A sufficient condition for backtrack-bounded search","volume":"32","author":"Freuder","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB74","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/mnsc.7.2.167","article-title":"A network flow computation for project cost curves","volume":"7","author":"Fulkerson","year":"1961","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB75","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1287\/opre.10.6.808","article-title":"Expected critical path lengths in PERT networks","volume":"10","author":"Fulkerson","year":"1962","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB76","doi-asserted-by":"crossref","unstructured":"W. Gaul, On stochastic analysis of project-networks, in: M.A.H. Dempster, J.K. Lenstra, A.H.G. Rinnoy Kan (Eds.), Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, pp. 297\u2013309","DOI":"10.1007\/978-94-009-7801-0_16"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB77","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling theory: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB78","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/nav.3800190110","article-title":"The payment scheduling problem","volume":"19","author":"Grinold","year":"1972","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB79","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum-flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB80","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.3230180206","article-title":"Computational complexity of PERT problems","volume":"18","author":"Hagstrom","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB81","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/net.3230200208","article-title":"Computing the probability distribution of project duration in a pert network","volume":"20","author":"Hagstrom","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB82","unstructured":"R.B. Harris, Precedence and Arrow Networking Techniques for Construction, Wiley, New York, 1978"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB83","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1061\/(ASCE)0733-9364(1990)116:2(331)","article-title":"Packing method for resource leveling (pack)","volume":"116","author":"Harris","year":"1990","journal-title":"Journal of Construction Engineering and Management"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB84","unstructured":"S. Hartmann, Project scheduling with multiple modes: A genetic algorithm, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel, no. 435, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB85","unstructured":"S. Hartmann, A competitive genetic algorithm for resource-constrained project scheduling, Naval Research Logistics, to appear"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB86","unstructured":"S. Hartmann, A. Drexl, Project scheduling with multiple modes: A comparison of exact algorithms, Networks, to appear"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB87","first-page":"107","article-title":"An implicit enumeration algorithm for the time\/cost tradeoff problem in project network analysis","volume":"4","author":"Harvey","year":"1979","journal-title":"Found. Control Eng."},{"key":"10.1016\/S0377-2217(98)00204-5_BIB88","unstructured":"R. Heilmann, A branch-and-bound procedure for MRCPSP\/max, Report WIOR-512, Universit\u00e4t Karlsruhe, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB89","unstructured":"R. Heilmann, C. Schwindt, Lower bounds for RCPSP\/max, Report WIOR-511, Universit\u00e4t Karlsruhe, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB90","first-page":"85","article-title":"On the shortest overall duration in stochastic project networks","volume":"42","author":"Heller","year":"1981","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB91","unstructured":"P. van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA, 1989"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB92","doi-asserted-by":"crossref","unstructured":"W. Herroelen, E. Demeulemeester, B. De Reyck, Resource-constrained project scheduling \u2013 A survey of recent developments, Computers and Operations Research, to appear","DOI":"10.1007\/978-3-642-60744-8_36"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB93","unstructured":"W. Herroelen, E.L. Demeulemeester, P. Van Dommelen, An optimal recursive search procedure for the deterministic unconstrained max-npv project scheduling problem, Research Report 9603, Department of Applied Economics, Katholieke Universiteit Leuven, 1996"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB94","unstructured":"W. Herroelen, E. Demeulemeester, B. De Reyck, A classification scheme for project scheduling problems, Technical Report, Department of Applied Economics, Katholieke Universiteit Leuven, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB95","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0377-2217(96)00112-9","article-title":"Project network models with discounted cash flows: A guided tour through recent developments","volume":"100","author":"Herroelen","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB96","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/opre.27.2.225","article-title":"A dynamic programming algorithm for Decision CPM networks","volume":"27","author":"Hindelang","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB97","unstructured":"J.A. Hoogeven, J.K. Lenstra, S.L. Van de Velde, Sequencing and scheduling, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, New York, 1997, pp. 181\u2013197"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB98","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1287\/mnsc.42.10.1395","article-title":"A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows","volume":"42","author":"Icmeli","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB99","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230130102","article-title":"Preselective strategies for the optimization of stochastic project networks under resource constraints","volume":"13","author":"Igelmund","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB100","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.3230130103","article-title":"Algorithmic approaches to preselective strategies for stochastic scheduling problems","volume":"13","author":"Igelmund","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB101","unstructured":"T.J.R. Johnson, An algorithm for the resource-constrained project scheduling problem, Ph.D. Dissertation, MIT, Boston, USA, 1967"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB102","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1287\/opre.9.3.296","article-title":"Critical path planning and scheduling: Mathematical basis","volume":"9","author":"Kelley","year":"1961","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB103","unstructured":"J.E. Kelley, The critical path method: Resource planning and scheduling, in: J.F. Muth, G.L. Thompson (Eds.), Industrial Scheduling, Prentice Hall, NJ, 1963, pp. 347\u2013365"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB104","doi-asserted-by":"crossref","unstructured":"J.E. Kelley, M.R. Walker, Critical Path Planning and Scheduling: An Introduction, Mauchly Associates, Ambler, PA, 1959","DOI":"10.1145\/1460299.1460318"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB105","unstructured":"R. Klein, A. Scholl, Computing lower bounds by destructive improvement \u2014 An application to resource\u2013constrained project scheduling, Working Paper, Technische Universit\u00e4t Darmstadt, 1997, European Journal of Operational Research, to appear"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB106","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BFb0121119","article-title":"Robustness against dependence in PERT: An application of duality and distributions with known marginals","volume":"27","author":"Klein Haneveld","year":"1986","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB107","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1287\/opre.19.7.1586","article-title":"Bounding distributions for a stochastic acyclic network","volume":"19","author":"Kleindorfer","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB108","unstructured":"U. Kohlmorgen, H. Schmeck, K. Haase, Experiences with fine-grained parallel genetic algorithms, Annals of Operations Research, to appear"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB109","doi-asserted-by":"crossref","unstructured":"R. Kolisch, Project Scheduling under Resource Constraints \u2013 Efficient Heuristics for Several Problem Classes, Physica, Heidelberg, 1995","DOI":"10.1007\/978-3-642-50296-5"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB110","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/(SICI)1520-6750(199602)43:1<23::AID-NAV2>3.0.CO;2-P","article-title":"Adaptive search for solving hard project scheduling problems","volume":"43","author":"Kolisch","year":"1996","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB111","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1080\/07408179708966417","article-title":"Local search for nonpreemptive multi-mode resource-constrained project scheduling","volume":"29","author":"Kolisch","year":"1997","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB112","doi-asserted-by":"crossref","unstructured":"R. Kolisch, S. Hartmann, Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis, in: J. W\u0229glarz (Ed.), Handbook on Recent Advances in Project Scheduling, Kluwer Academic Publishers, Dordrecht, 1998, to appear","DOI":"10.1007\/978-1-4615-5533-9_7"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB113","unstructured":"R. Kolisch, R. Padman, An integrated perspective of project scheduling, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel, no. 463, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB114","unstructured":"R. Kolisch, C. Schwindt, A. Sprecher, Benchmark instances for project scheduling problems; in: J. W\u0229glarz (Ed.): Handbook on Recent Advances in Project Scheduling, Kluwer Academic Publishers, Dordrecht, 1998, to appear"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB115","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB \u2013 A project scheduling problem library","volume":"96","author":"Kolisch","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB116","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","article-title":"Characterization and generation of a general class of resource-constrained project scheduling problems","volume":"41","author":"Kolisch","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB117","unstructured":"B. Korte, R.H. M\u00f6hring, Transitive orientation of graphs with side constraints, in: H. Noltemeier (Ed.), Proceedings of the 11th International Workshop on Graph Theoretical Concepts in Computer Science, Trauner, Linz, 1985, pp. 143\u2013160"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB118","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01545591","article-title":"Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors","volume":"19","author":"Kr\u00e4mer","year":"1997","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB119","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01719262","article-title":"Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling","volume":"17","author":"Leon","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB120","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","article-title":"Implementation of resource constraints in ILOG SCHEDULE \u2013 A library for the development of constraint-based scheduling systems","volume":"3","author":"Le Pape","year":"1994","journal-title":"Intelligent Systems Engineering"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB121","unstructured":"A. Ludwig, R.H. M\u00f6hring, F. Stork, A computational study on bounding the makespan distribution in stochastic project networks, Technical Report, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB122","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB123","doi-asserted-by":"crossref","unstructured":"P.D. Martin, D.B. Shmoys, A new approach to computing optimal schedules for the job shop scheduling problem, Proceedings of the Fifth International IPCO Conference, 1996","DOI":"10.1007\/3-540-61310-2_29"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB124","doi-asserted-by":"crossref","first-page":"671","DOI":"10.2307\/3213097","article-title":"Convex majorization with an application to the length of critical paths","volume":"16","author":"Meilijson","year":"1979","journal-title":"Journal of Applied Probability"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB125","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/AIC-1989-2101","article-title":"Constraint satisfaction problems: an overview","volume":"2","author":"Meseguer","year":"1989","journal-title":"AICOM"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB126","doi-asserted-by":"crossref","unstructured":"A. Mingozzi, V. Maniezzo, S. Ricciardelli, L. Bianco, An exact algorithm for the resource-constrained project scheduling based on a new mathematical formulation, Management Science 44 (1998), 714\u2013729","DOI":"10.1287\/mnsc.44.5.714"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB127","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.32.1.89","article-title":"Minimizing costs of resource requirements in project networks subject to a fixed completion time","volume":"32","author":"M\u00f6hring","year":"1984","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB128","unstructured":"R.H. M\u00f6hring, R. M\u00fcller, A combinatorial approach to bound the distribution function of the makespan in stochastic project networks, Technical Report, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB129","first-page":"257","article-title":"Substitution decomposition for discrete structures and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB130","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, F.J. Radermacher, The order-theoretic approach to scheduling: The deterministic case, in: R. S\u0142owi\u0144ski, J. W\u0229glarz (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989, pp. 29\u201366","DOI":"10.1016\/B978-0-444-87358-3.50006-7"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB131","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, F.J. Radermacher, The order-theoretic approach to scheduling: The stochastic case, in: R. S\u0142owi\u0144ski, J. W\u0229glarz (Eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989, pp. 497\u2013531","DOI":"10.1016\/B978-0-444-87358-3.50024-9"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB132","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01919323","article-title":"Stochastic scheduling problems I \u2013 General strategies","volume":"28","author":"M\u00f6hring","year":"1984","journal-title":"Zeitschrift f\u00fcr Operations Research Ser. A"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB133","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01918198","article-title":"Stochastic scheduling problems II \u2013 Set strategies","volume":"29","author":"M\u00f6hring","year":"1985","journal-title":"Zeitschrift f\u00fcr Operations Research Ser. A"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB134","unstructured":"R.H. M\u00f6hring, F. Stork, Linear preselective policies for stochastic project scheduling, Technical Report, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB135","unstructured":"R.H. M\u00f6hring, F. Stork, M. Uetz, Resource constrained project scheduling with time windows: A branching scheme based on dynamic release dates, Technical Report, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB136","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Information Sciences"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB137","doi-asserted-by":"crossref","unstructured":"V. Naumann, Measuring the distance to series-parallelity by path expressions, in: E.W. Mayr, G. Schmidt, G. Tinhofer (Eds.), Proceedings of the 20th International Workshop on Graph\u2013Theoretic Concepts in Computer Science WG'94, Lecture Notes in Computer Science, vol. 903, Springer, Berlin, 1995, pp. 269\u2013281","DOI":"10.1007\/3-540-59071-4_54"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB138","unstructured":"K. Neumann, C. Schwindt, Projects with minimal and maximal time lags: construction of activity-on-node networks and applications, Report WIOR-447, Universit\u00e4t Karlsruhe, 1995"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB139","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01545589","article-title":"Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production","volume":"19","author":"Neumann","year":"1997","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB140","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00123686","article-title":"Heuristics for the minimum project-duration problem with minimal and maximal time-lags under fixed resource constraints","volume":"6","author":"Neumann","year":"1995","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB141","unstructured":"K. Neumann, J. Zimmermann, Resource leveling for projects with schedule-dependent time windows, European Journal of Operational Research, to appear"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB142","doi-asserted-by":"crossref","unstructured":"K. Neumann, J. Zimmermann, Methods for resource-constrained project scheduling with regular and nonregular objective functions and schedule-dependent time windows; in: J. Weglarz (Ed.), Handbook on Recent Advances in Project Scheduling, Kluwer Academic Publishers, Dordrecht, 1998, to appear","DOI":"10.1007\/978-1-4615-5533-9_12"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB143","unstructured":"H. N\u00fcbel, A branch-and-bound procedure for the resource investment problem with generalized precedence constraints, Report WIOR-516, Universit\u00e4t Karlsruhe, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB144","unstructured":"H. N\u00fcbel, C. Schwindt, A classification of shifts, schedules, and objective functions in project scheduling, Report WIOR-509, Universit\u00e4t Karlsruhe, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB145","unstructured":"W.P.M. Nuijten, Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, Ph.D. Thesis, Eindhoven University of Technology, 1994"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB146","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","article-title":"A computational study of constraint satisfaction for multiple capacitated job-shop scheduling","volume":"90","author":"Nuijten","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB147","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1009687210594","article-title":"Constraint based job shop scheduling with ILOG SCHEDULER","volume":"3","author":"Nuijten","year":"1998","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB148","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/0377-2217(94)90319-0","article-title":"A comparative study of computational procedures for the resource constrained project scheduling problem","volume":"72","author":"Oguz","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB149","unstructured":"L. \u00d6zdamar, A genetic algorithm approach to a general category project scheduling problem, Research Report, Marmara University, Istanbul, 1996"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB150","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0377-2217(94)90359-X","article-title":"A local constraint based analysis approach to project scheduling under general resource constraints","volume":"79","author":"\u00d6zdamar","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB151","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1080\/07408179508936773","article-title":"A survey on the resource-constrained project scheduling problem","volume":"27","author":"\u00d6zdamar","year":"1995","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB152","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/(SICI)1520-6750(199706)44:4<365::AID-NAV6>3.0.CO;2-4","article-title":"Heuristic scheduling of resource-constrained projects with cash flows: An optimization approach","volume":"44","author":"Padman","year":"1997","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB153","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800230110","article-title":"Project scheduling: The effect of problem structure on heuristic performance","volume":"23","author":"Patterson","year":"1976","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB154","doi-asserted-by":"crossref","unstructured":"J.H. Patterson, A comparison of exact approaches for solving the multiple constrained resource project scheduling problem, Research Report, Department of Industrial and Manufacturing Systems Engineering, Lehigh University, 1984","DOI":"10.1287\/mnsc.30.7.854"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB155","doi-asserted-by":"crossref","unstructured":"J.H. Patterson, R. S\u0142owi\u0144ski, F.B. Talbot, J. W\u0229glarz, An algorithm for a general class of precedence and resource constrained scheduling problems, in: R. S\u0142owi\u0144ski, J. W\u0229glarz (Eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989, pp. 3\u201328","DOI":"10.1016\/B978-0-444-87358-3.50005-5"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB156","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(90)90121-Q","article-title":"Computational experience with a backtracking algorithm for solving a general class of resource constrained scheduling problems","volume":"90","author":"Patterson","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB157","doi-asserted-by":"crossref","unstructured":"E. Pesch, Learning in Automated Manufacturing, Physica, Heidelberg, 1994","DOI":"10.1007\/978-3-642-49366-9"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB158","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1287\/ijoc.8.2.144","article-title":"Constraint propagation based scheduling of job shops","volume":"8","author":"Pesch","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB159","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/mnsc.24.4.393","article-title":"Solving the project time\/cost tradeoff problem using the minimal cut concept","volume":"24","author":"Phillips","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB160","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1287\/mnsc.25.4.396","article-title":"The cut search algorithm with arc capacities and lower bounds","volume":"25","author":"Phillips","year":"1979","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB161","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB162","first-page":"136","article-title":"Invarianzaussagen f\u00fcr stochastische Netzpl\u00e4ne","volume":"22","author":"Radermacher","year":"1976","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB163","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/opre.24.1.177","article-title":"Expected completion time in PERT networks","volume":"24","author":"Robillard","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB164","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/mnsc.22.2.158","article-title":"A dynamic programming solution to the cost\u2013time tradeoff for CPM","volume":"22","author":"Robinson","year":"1975","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB165","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.18.6.992","article-title":"Optimal design of offshore natural-gas pipeline systems","volume":"18","author":"Rothfarb","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB166","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1287\/mnsc.16.5.357","article-title":"Cash flows in networks","volume":"16","author":"Russel","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB167","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1287\/mnsc.32.10.1291","article-title":"A comparison of heuristics for scheduling projects with cash flows and resource restrictions","volume":"32","author":"Russell","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB168","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(96)00219-6","article-title":"Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application","volume":"102","author":"Salewski","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB169","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1002\/1520-6750(199308)40:5<665::AID-NAV3220400509>3.0.CO;2-J","article-title":"Local search techniques for the generalized resource constrained project scheduling problem","volume":"40","author":"Sampson","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB170","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0965-9978(97)00019-7","article-title":"A procedure for calculating the weight-matrix of a neuronal network for resource leveling","volume":"28","author":"Savin","year":"1997","journal-title":"Advances in Engineering Software"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB171","unstructured":"A. Schirmer, A. Drexl, Allocation of partially renewable resources \u2013 concept, models and application, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel, no. 455, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB172","unstructured":"A. Schoo, Untere Schranken und Immediate Selection f\u00fcr das Resource-Constrained-Projekt Scheduling Problem, Diplomarbeit, Fachbereich Mathematik\/Informatik, Unversit\u00e4t Osnabr\u00fcck, 1996"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB173","unstructured":"C. Schwindt, Generation of resource-constrained scheduling problems with minimal and maximal time lags, Report WIOR-489, Universit\u00e4t Karlsruhe, 1996"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB174","unstructured":"C. Schwindt, Verfahren zur L\u00f6sung des ressourcenbeschr\u00e4nkten Projektdauerminimierungsproblems mit planungsabh\u00e4ngigen Zeitfenstern, Shaker, Aachen, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB175","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/net.3230070407","article-title":"Bounding distributions for a stochastic PERT network","volume":"7","author":"Shogan","year":"1977","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB176","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0378-4754(79)90007-7","article-title":"The use of cutset in Monte Carlo analysis of stochastic networks","volume":"21","author":"Sigal","year":"1979","journal-title":"Mathematics and Computers in Simulation"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB177","unstructured":"M. Skutella, Approximation algorithms for the discrete time\u2013cost tradeoff problem, in: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 1997, pp. 501\u2013508"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB178","unstructured":"M. Skutella, Approximation and randomization in scheduling, Ph.D. Thesis, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB179","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0377-2217(94)90353-0","article-title":"DSS for multiobjective project scheduling subject to multiple-category resource constraints","volume":"79","author":"S\u0142owi\u0144ski","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB180","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1287\/opre.11.5.839","article-title":"Monte Carlo methods and the PERT problem","volume":"11","author":"van Slyke","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB181","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0377-2217(93)90063-S","article-title":"Risk taking in stochastic PERT networks","volume":"67","author":"Soroush","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB182","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1057\/jors.1994.42","article-title":"The most critical path in a PERT network","volume":"45","author":"Soroush","year":"1994","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB183","unstructured":"H.G. Spelde, Stochastische Netzpl\u00e4ne und ihre Anwendung im Baubetrieb, Ph.D. Thesis, Rheinisch-Westf\u00e4lische Technische Hochschule Aachen, 1976"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB184","doi-asserted-by":"crossref","unstructured":"A. Sprecher, Resource-Constrained Project Scheduling \u2013 Exact Methods for the Multi-Mode Case, Springer, Berlin, 1994","DOI":"10.1007\/978-3-642-48397-4"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB185","unstructured":"A. Sprecher, Solving the RCPSP efficiently at modest memory requirements, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel, no. 426, 1996"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB186","doi-asserted-by":"crossref","unstructured":"A. Sprecher, A. Drexl, Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm, European Journal of Operational Research, 107 (1998) 431\u2013450","DOI":"10.1016\/S0377-2217(97)00348-2"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB187","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01545587","article-title":"An exact algorithm for project scheduling with multiple modes","volume":"19","author":"Sprecher","year":"1997","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB188","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1080\/05695557808975212","article-title":"Multiple resource-constrained scheduling using branch and bound","volume":"10","author":"Stinson","year":"1978","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB189","unstructured":"F. Stork, A branch and bound algorithm for minimizing expected makespan in stochastic project networks with resource constraints, Technical Report, Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Berlin, Germany, 1998"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB190","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/opre.28.3.614","article-title":"A comparison of the method of bounding distributions (MBD) and Monte Carlo simulation for analyzing stochastic acyclic networks","volume":"28","author":"Sullivan","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB191","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/scj.4690261007","article-title":"Zero\u2013one quadratic programming algorithm for resource leveling of manufacturing process schedules","volume":"26","author":"Takamoto","year":"1995","journal-title":"Systems and Computers in Japan"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB192","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","article-title":"Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case","volume":"28","author":"Talbot","year":"1982","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB193","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1287\/mnsc.24.11.1163","article-title":"An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems","volume":"24","author":"Talbot","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB194","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/mnsc.23.4.412","article-title":"Heuristic scheduling of activities under resource and precedence restrictions","volume":"23","author":"Thesen","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB195","unstructured":"E. Tsang, Foundations of Constraint Satisfaction, Academic Press, London, 1993"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB196","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1080\/00207549408956961","article-title":"A constrained-based perspective in resource constrained project scheduling","volume":"32","author":"Ulusoy","year":"1994","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB197","unstructured":"D. Waltz, Understanding line drawings of scenes with shadows, in: P.H. Winston (Ed.), Psychology of Computer Vision, McGraw Hill, Cambridge, MA, 1975, pp. 19\u201391"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB198","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.34.4.595","article-title":"Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability","volume":"34","author":"Weiss","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB199","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0377-2217(94)00039-F","article-title":"A comparison of stochastic scheduling rules for maximizing project net present value","volume":"85","author":"Yang","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB200","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0360-8352(96)00116-7","article-title":"Optimal resource leveling of multi-resource projects","volume":"31","author":"Younis","year":"1996","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB201","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0377-2217(94)90016-7","article-title":"Heuristics for scheduling resource-constrained projects in MPM networks","volume":"76","author":"Zhan","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB202","unstructured":"J. Zimmermann, Heuristics for resource-leveling problems in project scheduling with minimum and maximum time lags, Report WIOR\u2013491, Universit\u00e4t Karlsruhe, 1997"},{"key":"10.1016\/S0377-2217(98)00204-5_BIB203","unstructured":"J. Zimmermann, H. Engelhardt, Lower bounds and exact algorithms for resource levelling problems, Report WIOR-517, Universit\u00e4t Karlsruhe, 1998"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798002045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798002045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T22:16:13Z","timestamp":1681164973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798002045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":203,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221798002045"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00204-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}