IDEAS home Printed from https://ideas.repec.org/p/dar/wpaper/8114.html
   My bibliography  Save this paper

An integrated survey of deterministic project scheduling

Author

Listed:
  • Kolisch, Rainer
  • Padman, R.

Abstract

There have been many survey papers in the area of project scheduling in recent years. These papers have primarily emphasized modeling and algorithmic contributions for specific classes of project scheduling problems, such as net present value (NPV) maximization and makespan minimization, with and without resource constraints. Paralleling these developments has been the research in the area of project scheduling decision support, with its emphasis on data sets, data generation methods, and so on, that are essential to benchmark, evaluate, and compare the new models, algorithms and heuristic techniques. These investigations have extended the frontiers of research and application in all areas of project scheduling and management. In this paper, we survey the vast literature in this area with a perspective that integrates models, data, and optimal and heuristic algorithms, for the major classes of project scheduling problems. We also include recent surveys that have compared commercial project scheduling systems. Finally, we present an overview of web-based decision support systems and discuss the potential of this technology in enabling and facilitating researchers and practitioners in identifying new areas of inquiry and application.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Kolisch, Rainer & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 8114, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  • Handle: RePEc:dar:wpaper:8114
    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/8114/
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Klein, Robert & Scholl, Armin, 1998. "Scattered branch and bound: an adaptive search strategy applied to resource-constrained project scheduling," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 14076, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Erik Demeulemeester, 1995. "Minimizing Resource Availability Costs in Time-Limited Project Networks," Management Science, INFORMS, vol. 41(10), pages 1590-1598, October.
    3. A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
    4. Kolisch, Rainer, 1999. "Resource allocation capabilities of commercial project management software packages," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7938, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. Deckro, RF & Hebert, JE, 1989. "Resource constrained project crashing," Omega, Elsevier, vol. 17(1), pages 69-79.
    6. Hartmann, Sonke & Kolisch, Rainer, 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 394-407, December.
    7. Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
    8. Elmaghraby, Salah E., 1990. "Project bidding under deterministic and probabilistic activity durations," European Journal of Operational Research, Elsevier, vol. 49(1), pages 14-34, November.
    9. Linus Schrage, 1970. "Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case," Operations Research, INFORMS, vol. 18(2), pages 263-278, April.
    10. Herroelen, Willy S. & Gallens, Els, 1993. "Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 65(2), pages 274-277, March.
    11. Hartmann, Sonke & Sprecher, Arno, 1996. "A note on "hierarchical models for multi-project planning and scheduling"," European Journal of Operational Research, Elsevier, vol. 94(2), pages 377-383, October.
    12. F. Brian Talbot, 1982. "Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case," Management Science, INFORMS, vol. 28(10), pages 1197-1210, October.
    13. Edward W. Davis & James H. Patterson, 1975. "A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling," Management Science, INFORMS, vol. 21(8), pages 944-955, April.
    14. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
    15. Brucker, Peter & Knust, Sigrid & Schoo, Arno & Thiele, Olaf, 1998. "A branch and bound algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 272-288, June.
    16. Ozdamar, Linet & Ulusoy, Gunduz, 1994. "A local constraint based analysis approach to project scheduling under general resource constraints," European Journal of Operational Research, Elsevier, vol. 79(2), pages 287-298, December.
    17. Eglese, R. W., 1990. "Simulated annealing: A tool for operational research," European Journal of Operational Research, Elsevier, vol. 46(3), pages 271-281, June.
    18. Hapke, Maciej & Jaszkiewicz, Andrzej & Slowinski, Roman, 1998. "Interactive analysis of multiple-criteria project scheduling problems," European Journal of Operational Research, Elsevier, vol. 107(2), pages 315-324, June.
    19. James H. Patterson & Walter D. Huber, 1974. "A Horizon-Varying, Zero-One Approach to Project Scheduling," Management Science, INFORMS, vol. 20(6), pages 990-998, February.
    20. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
    21. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    22. Kedar Naphade & S. David Wu & Robert Storer, 1997. "Problem space search algorithms for resource-constrained project scheduling," Annals of Operations Research, Springer, vol. 70(0), pages 307-326, April.
    23. Robert H. Storer & S. David Wu & Renzo Vaccari, 1992. "New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling," Management Science, INFORMS, vol. 38(10), pages 1495-1509, October.
    24. Dan Zhu & Rema Padman, 1997. "Connectionist approaches for solver selection in constrained project scheduling," Annals of Operations Research, Springer, vol. 72(0), pages 265-298, January.
    25. Rainer Kolisch & Arno Sprecher & Andreas Drexl, 1995. "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, INFORMS, vol. 41(10), pages 1693-1703, October.
    26. Robert A. Russell, 1986. "A Comparison of Heuristics for Scheduling Projects with Cash Flows and Resource Restrictions," Management Science, INFORMS, vol. 32(10), pages 1291-1300, October.
    27. Robert H. Doersch & James H. Patterson, 1977. "Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach," Management Science, INFORMS, vol. 23(8), pages 882-889, April.
    28. Prabuddha De & E. James Dunne & Jay B. Ghosh & Charles E. Wells, 1997. "Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks," Operations Research, INFORMS, vol. 45(2), pages 302-306, April.
    29. Yau, Chuk & Ritchie, Eric, 1990. "Project compression: A method for speeding up resource constrained projects which preserve the activity schedule," European Journal of Operational Research, Elsevier, vol. 49(1), pages 140-152, November.
    30. Böttcher, Jan & Drexl, A. & Kolisch, R. & Salewski, F., 1999. "Project scheduling under partially renewable resource constraints," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 345, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    31. Zhan, Ji, 1994. "Heuristics for scheduling resource-constrained projects in MPM networks," European Journal of Operational Research, Elsevier, vol. 76(1), pages 192-205, July.
    32. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    33. Jungen, F. J. & Kowalczyk, W., 1995. "An intelligent interactive project management support system," European Journal of Operational Research, Elsevier, vol. 84(1), pages 60-81, July.
    34. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    35. De, Prabuddha & James Dunne, E. & Ghosh, Jay B. & Wells, Charles E., 1995. "The discrete time-cost tradeoff problem revisited," European Journal of Operational Research, Elsevier, vol. 81(2), pages 225-238, March.
    36. Icmeli-Tukel, Oya & Rom, Walter O., 1997. "Ensuring quality in resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 103(3), pages 483-496, December.
    37. Arno Sprecher, 2000. "Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements," Management Science, INFORMS, vol. 46(5), pages 710-723, May.
    38. E. Demeulemeester & B. Dodin & W. Herroelen, 1993. "A Random Activity Network Generator," Operations Research, INFORMS, vol. 41(5), pages 972-980, October.
    39. Erik L. Demeulemeester & Willy S. Herroelen, 1997. "A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem," Operations Research, INFORMS, vol. 45(2), pages 201-212, April.
    40. Boctor, Fayer F., 1990. "Some efficient multi-heuristic procedures for resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 49(1), pages 3-13, November.
    41. Egon Balas, 1969. "Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm," Operations Research, INFORMS, vol. 17(6), pages 941-957, December.
    42. Kolisch, Rainer & Schwindt, Christoph & Sprecher, Arno, 1999. "Benchmark instances for project scheduling problems," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9500, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    43. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    44. U. Kohlmorgen & H. Schmeck & K. Haase, 1999. "Experiences with fine‐grainedparallel genetic algorithms," Annals of Operations Research, Springer, vol. 90(0), pages 203-219, January.
    45. Hartmann, Sönke, 1999. "Self-adapting genetic algorithms with an application to project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 506, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    46. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    47. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    48. Kolisch, Rainer & Hartmann, Sönke, 1999. "Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10966, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    49. Sprecher, Arno & Drexl, Andreas, 1998. "Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm," European Journal of Operational Research, Elsevier, vol. 107(2), pages 431-450, June.
    50. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    51. Slowinski, Roman & Soniewicki, Boleslaw & Weglarz, Jan, 1994. "DSS for multiobjective project scheduling," European Journal of Operational Research, Elsevier, vol. 79(2), pages 220-229, December.
    52. Patterson, James H. & Brian Talbot, F. & Slowinski, Roman & Weglarz, Jan, 1990. "Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems," European Journal of Operational Research, Elsevier, vol. 49(1), pages 68-79, November.
    53. A. H. Russell, 1970. "Cash Flows in Networks," Management Science, INFORMS, vol. 16(5), pages 357-373, January.
    54. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    55. Oguz, Osman & Bala, Hasan, 1994. "A comparative study of computational procedures for the resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 72(2), pages 406-416, January.
    56. Klein, Robert, 1998. "Bidirectional planning: improving priority rule based heuristics for scheduling resource-constrained projects," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 14074, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    57. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    58. Rainer Kolisch, 1999. "Resource Allocation Capabilities of Commercial Project Management Software Packages," Interfaces, INFORMS, vol. 29(4), pages 19-31, August.
    59. Agrawal, M. K. & Elmaghraby, S. E. & Herroelen, W. S., 1996. ": A generator of testsets for project activity nets," European Journal of Operational Research, Elsevier, vol. 90(2), pages 376-382, April.
    60. Bandelloni, M. & Tucci, M. & Rinaldi, R., 1994. "Optimal resource leveling using non-serial dyanamic programming," European Journal of Operational Research, Elsevier, vol. 78(2), pages 162-177, October.
    61. Demeulemeester, Erik L. & Herroelen, Willy S. & Elmaghraby, Salah E., 1996. "Optimal procedures for the discrete time/cost trade-off problem in project networks," European Journal of Operational Research, Elsevier, vol. 88(1), pages 50-68, January.
    62. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    63. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    64. Hartmann, Sönke, 1997. "Project scheduling with multiple modes: A genetic algorithm," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 435, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    65. De Reyck, Bert & Herroelen, Willy, 1996. "On the use of the complexity index as a measure of complexity in activity networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 347-366, June.
    66. Sepil, Canan, 1994. "Comment on elmaghraby and herroelen's "The scheduling of activities to maximize the net present value of projects"," European Journal of Operational Research, Elsevier, vol. 73(1), pages 185-187, February.
    67. Nazareth, Terence & Verma, Sanjay & Bhattacharya, Subir & Bagchi, Amitava, 1999. "The multiple resource constrained project scheduling problem: A breadth-first approach," European Journal of Operational Research, Elsevier, vol. 112(2), pages 347-366, January.
    68. Ozdamar, Linet & Ulusoy, Gunduz, 1996. "A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis," European Journal of Operational Research, Elsevier, vol. 89(2), pages 400-407, March.
    69. Dale F. Cooper, 1976. "Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation," Management Science, INFORMS, vol. 22(11), pages 1186-1194, July.
    70. Padman, Rema & Smith-Daniels, Dwight E., 1993. "Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach," European Journal of Operational Research, Elsevier, vol. 64(2), pages 295-311, January.
    71. Deckro, Richard F. & Hebert, John E., 1990. "A multiple objective programming framework for tradeoffs in project scheduling," Engineering Costs and Production Economics, Elsevier, vol. 18(3), pages 255-264, January.
    72. Ahn, Taeho & Erenguc, S. Selcuk, 1998. "The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 107(2), pages 250-259, June.
    73. Jerome D. Wiest, 1967. "A Heuristic Model for Scheduling Large Projects with Limited Resources," Management Science, INFORMS, vol. 13(6), pages 359-377, February.
    74. Norbis, Mario & MacGregor Smith, J., 1996. "An interactive decision support system for the resource Constrained Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 94(1), pages 54-65, October.
    75. Erik L. Demeulemeester & Willy S. Herroelen, 1997. "New Benchmark Results for the Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 43(11), pages 1485-1492, November.
    76. Boctor, Fayez F., 1996. "A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes," European Journal of Operational Research, Elsevier, vol. 90(2), pages 349-361, April.
    77. Hartmann, Sönke & Kolisch, R., 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 11180, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    78. Li, K. Y. & Willis, R. J., 1992. "An iterative scheduling technique for resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 56(3), pages 370-379, February.
    79. Elmaghraby, Salah E. & Herroelen, Willy S., 1990. "The scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 49(1), pages 35-49, November.
    80. Edward H. Bowman, 1959. "The Schedule-Sequencing Problem," Operations Research, INFORMS, vol. 7(5), pages 621-624, October.
    81. Edward W. Davis & George E. Heidorn, 1971. "An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints," Management Science, INFORMS, vol. 17(12), pages 803-816, August.
    82. Speranza, M. Grazia & Vercellis, Carlo, 1993. "Hierarchical models for multi-project planning and scheduling," European Journal of Operational Research, Elsevier, vol. 64(2), pages 312-325, January.
    83. Valadares Tavares, L., 1999. "A review of major paradigms and models for the design of civil engineering systems," European Journal of Operational Research, Elsevier, vol. 119(1), pages 1-13, November.
    84. Arne Thesen, 1976. "Heuristic Scheduling of Activities under Resource and Precedence Restrictions," Management Science, INFORMS, vol. 23(4), pages 412-422, December.
    85. Jerome D. Wiest, 1964. "Some Properties of Schedules for Large Projects with Limited Resources," Operations Research, INFORMS, vol. 12(3), pages 395-418, June.
    86. F. Brian Talbot & James H. Patterson, 1978. "An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems," Management Science, INFORMS, vol. 24(11), pages 1163-1174, July.
    87. Mori, Masao & Tseng, Ching Chih, 1997. "A genetic algorithm for multi-mode resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 134-141, July.
    88. Elmaghraby, Salah E., 1995. "Activity nets: A guided tour through some recent developments," European Journal of Operational Research, Elsevier, vol. 82(3), pages 383-408, May.
    89. Oya Icmeli & S. Selcuk Erenguc, 1996. "A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows," Management Science, INFORMS, vol. 42(10), pages 1395-1408, October.
    90. Klein, Robert & Scholl, Armin, 1998. "PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 14077, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    91. De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
    92. De Wit, Jan & Herroelen, Willy, 1990. "An evaluation of microcomputer-based software packages for project management," European Journal of Operational Research, Elsevier, vol. 49(1), pages 102-139, November.
    93. Andreas Drexl, 1991. "Scheduling of Project Networks by Job Assignment," Management Science, INFORMS, vol. 37(12), pages 1590-1602, December.
    94. James H. Patterson, 1984. "A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem," Management Science, INFORMS, vol. 30(7), pages 854-867, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    2. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    3. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    4. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    5. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    6. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    8. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Kolisch, Rainer & Padman, Rema, 1997. "An integrated survey of project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 463, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    11. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    12. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    13. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Kolisch, Rainer, 1994. "Efficient priority rules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 350, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    16. Peteghem, Vincent Van & Vanhoucke, Mario, 2010. "A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 409-418, March.
    17. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    18. Andreas Schirmer, 2000. "Case‐based reasoning and improved adaptive search for project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 201-222, April.
    19. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    20. Klein, Robert, 2000. "Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects," European Journal of Operational Research, Elsevier, vol. 127(3), pages 619-638, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:dar:wpaper:8114. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Dekanatssekretariat (email available below). General contact details of provider: https://edirc.repec.org/data/ivthdde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.