Skip to main content

Time-Varying Resource Requirements and Capacities

  • Chapter
  • First Online:

Part of the book series: International Handbooks on Information Systems ((INFOSYS))

Abstract

This contribution discusses an extension of the classical resource-constrained project scheduling problem (RCPSP) in which the resource requests of the activities and the resource capacities may change over time. We present relationships to other variants of the RCPSP as well as some applications of this problem setting. Subsequently, we analyze the applicability of heuristics which were originally developed for the standard RCPSP and adapt one of them, a genetic algorithm, to this extension. The chapter closes with a few computational results and some remarks on research perspectives.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  • Bartusch M, Möhring RH, Radermacher FJ (1988) Scheduling project networks with resource constraints and time windows. Ann Oper Res 16:201–240

    Article  Google Scholar 

  • Böttcher J, Drexl A, Kolisch R, Salewski F (1999) Project scheduling under partially renewable resource constraints. Manage Sci 45:543–559

    Article  Google Scholar 

  • Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112:3–41

    Article  Google Scholar 

  • Cho JH, Kim YD (1997) A simulated annealing algorithm for resource-constrained project scheduling problems. J Oper Res Soc 48:736–744

    Article  Google Scholar 

  • de Reyck B, Demeulemeester EL, Herroelen WS (1999) Algorithms for scheduling projects with generalized precedence relations. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer, Boston, pp 77–106

    Chapter  Google Scholar 

  • Hartmann S (1998) A competitive genetic algorithm for resource-constrained project scheduling. Nav Res Logist 45:733–750

    Article  Google Scholar 

  • Hartmann S (2013) Project scheduling with resource capacities and requests varying with time: a case study. Flex Serv Manuf J 25:74–93

    Google Scholar 

  • Hartmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207:1–14

    Article  Google Scholar 

  • Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127:394–407

    Article  Google Scholar 

  • Heimerl C, Kolisch R (2010) Scheduling and staffing multiple projects with a multi-skilled workforce. OR Spectr 32:343–368

    Article  Google Scholar 

  • Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90:320–333

    Article  Google Scholar 

  • Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer, Boston, pp 147–178

    Chapter  Google Scholar 

  • Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174:23–37

    Article  Google Scholar 

  • Kolisch R, Meyer K (2006) Selection and scheduling of pharmaceutical research projects. In: Jozefowska J, Wȩglarz J (eds) Perspectives in modern project scheduling. Springer, New York, pp 321–344

    Google Scholar 

  • Kolisch R, Sprecher A (1996) PSPLIB – a project scheduling problem library. Eur J Oper Res 96:205–216

    Article  Google Scholar 

  • Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Manage Sci 41:1693–1703

    Article  Google Scholar 

  • Pritsker AAB, Watters LJ, Wolfe PM (1969) Multiproject scheduling with limited resources: a zero-one programming approach. Manage Sci 16:93–107

    Google Scholar 

  • Sprecher A (1994) Resource-constrained project scheduling: exact methods for the multi-mode case. Lecture notes in economics and mathematical systems, No. 409. Springer, Berlin

    Google Scholar 

  • Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem. Eur J Oper Res 80:94–102

    Article  Google Scholar 

  • Tormos P, Lova A (2001) A competitive heuristic solution technique for resource-constrained project scheduling. Ann Oper Res 102:65–81

    Article  Google Scholar 

  • Valls V, Ballestín F, Quintanilla MS (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165:375–386

    Article  Google Scholar 

Download references

Acknowledgements

The author was supported by the HSBA foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sönke Hartmann .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Hartmann, S. (2015). Time-Varying Resource Requirements and Capacities. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol.1. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05443-8_8

Download citation

Publish with us

Policies and ethics