Skip to main content

Resource-Constrained Scheduling Extensions

  • Chapter
  • First Online:
Project Management with Dynamic Scheduling

Abstract

Resource-constrained project scheduling has been a topic in both the research community and the practical oriented business magazines. This chapter presents some advanced results obtained by various research projects, extends the resource models of the previous chapter to other scheduling objectives, studies the effect of activity splitting and setup times and introduces learning effects in a resource-constrained project environment. Each part of this section can be considered as a special topic of resource-constrained project scheduling and can be easily skipped without losing overview on the general dynamic scheduling theme described throughout the book.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.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

Institutional subscriptions

Notes

  1. 1.

    In Chap. 9, it will be shown that there is a trade-off between the project duration and the idle time of expensive freezing machines for the construction of a tunnel under the Westerschelde.

  2. 2.

    The activity durations, their start times and the corresponding project duration for each schedule depend on the degree of learning for each activity. The calculations and construction of the schedule are outside the scope of this section and are determined by an algorithm developed by Van Peteghem and Vanhoucke (2010a).

References

  • Agrawal M, Elmaghraby S, Herroelen W (1996) DAGEN: a generator of testsets for project activity nets. Eur J Oper Res 90:376–382

    Article  Google Scholar 

  • Akkan C, Drexl A, Kimms A (2005) Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur J Oper Res 165:339–358

    Article  Google Scholar 

  • Alvarez-Valdes R, Tamarit J (1989) Heuristic algorithms for resource-constrained project scheduling: a review and empirical analysis. In: Slowinski R, Weglarz J (eds) Advances in project scheduling. Elsevier, Amsterdam

    Google Scholar 

  • Amor J, Teplitz C (1998) An efficient approximation procedure for project composite learning curves. Proj Manag J 29:28–42

    Google Scholar 

  • Ash R, Smith-Daniels DE (1999) The effects of learning, forgetting, and relearning on decision rule performance in multiproject scheduling. Decis Sci 30:47–82

    Article  Google Scholar 

  • Bein W, Kamburowski J, Stallmann M (1992) Optimal reduction of two-terminal directed acyclic graphs. SIAM J Comput 21:1112–1129

    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 

  • Cooper D (1976) Heuristics for scheduling resource-constrained projects: an experimental investigation. Manag Sci 22:1186–1194

    Article  Google Scholar 

  • Dar-El E (1973) MALB - A heuristic technique for balancing large single-model assembly lines. IIE Trans 5:343–356

    Google Scholar 

  • Davies E (1974) An experimental investigation of resource allocation in multiactivity projects. Oper Res Q 24:587–591

    Article  Google Scholar 

  • Davis E (1975) Project network summary measures constrained-resource scheduling. AIIE Trans 7:132–142

    Article  Google Scholar 

  • De Boer R (1998) Resource-constrained multi-project management - A hierarchical decision support system. PhD thesis, Institute for Business Engineering and Technology Application, The Netherlands

    Google Scholar 

  • Demeulemeester E (1995) Minimizing resource availability costs in time-limited project networks. Manag Sci 41:1590–1598

    Article  Google Scholar 

  • Demeulemeester E, Dodin B, Herroelen W (1993) A random activity network generator. Oper Res 41:972–980

    Article  Google Scholar 

  • Demeulemeester E, Vanhoucke M, Herroelen W (2003) Rangen: a random network generator for activity-on-the-node networks. J Sched 6:17–38

    Article  Google Scholar 

  • Drexl A, Nissen R, Patterson J, Salewski F (2000) ProGen/Ï€x - an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. Eur J Oper Res 125:59–72

    Article  Google Scholar 

  • El-Rayes K, Moselhi O (1998) Resource-driven scheduling of repetitive activities. Constr Manage Econ 16:433–446

    Article  Google Scholar 

  • Elmaghraby S, Herroelen W (1980) On the measurement of complexity in activity networks. Eur J Oper Res 5:223–234

    Article  Google Scholar 

  • Gong D (1997) Optimization of float use in risk analysis-based network scheduling. Int J Proj Manag 15:187–192

    Article  Google Scholar 

  • Goto E, Joko T, Fujisawa K, Katoh N, Furusaka S (2000) Maximizing net present value for generalized resource constrained project scheduling problem. Working paper, Nomura Research Institute, Japan

    Google Scholar 

  • Harris R, Ioannou P (1998) Scheduling projects with repeating activities. J Constr Eng Manag 124:269–278

    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 

  • Herroelen W, De Reyck B (1999) Phase transitions in project scheduling. J Oper Res Soc 50: 148–156

    Google Scholar 

  • Herroelen W, Demeulemeester E, De Reyck B (1999) A classification scheme for project scheduling problem. In: Weglarz J (ed) Project scheduling - Recent models, algorithms and applications. Kluwer Academic Publishers, Dortrecht, pp 1–26

    Google Scholar 

  • Kaimann R (1974) Coefficient of network complexity. Manag Sci 21:172–177

    Article  Google Scholar 

  • Kaimann R (1975) Coefficient of network complexity: erratum. Manag Sci 21:1211–1212

    Google Scholar 

  • Kang L, Park IC, Lee BH (2001) Optimal schedule planning for multiple, repetitive construction process. J Constr Eng Manag 127:382–390

    Article  Google Scholar 

  • Kao E, Queyranne M (1982) On dynamic programming methods for assembly line balancing. Oper Res 30:375–390

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Mastor A (1970) An experimental and comparative evaluation of production line balancing techniques. Manag Sci 16:728–746

    Article  Google Scholar 

  • Mika M (2006) Modelling setup times in project scheduling. In: Perspectives in modern project scheduling, vol 92, International series in operations research & management science. Springer, New York, pp 131–163

    Google Scholar 

  • Möhring R (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper Res 32:89–120

    Article  Google Scholar 

  • Nembhard D, Uzumeri M (2000) An individual-based description of learning within an organization. IEEE Trans Eng Manag 47(3):370–378

    Article  Google Scholar 

  • Pascoe T (1966) Allocation of resources - CPM. Revue Française de Recherche Opérationnelle 38:31–38

    Google Scholar 

  • Patterson J (1976) Project scheduling: the effects of problem structure on heuristic scheduling. Nav Res Logist 23:95–123

    Article  Google Scholar 

  • Schwindt C (1995) A new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags. WIOR-Report-449, Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe

    Google Scholar 

  • Shtub A, LeBlanc L, Cai Z (1996) Scheduling programs with repetitive projects: a comparison of a simulated annealing, a genetic and a pair-wise swap algorithm. Eur J Oper Res 88:124–138

    Article  Google Scholar 

  • Tavares L (1999) Advanced models for project management. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  • Tavares L, Ferreira J, Coelho J (1999) The risk of delay of a project in terms of the morphology of its network. Eur J Oper Res 119:510–537

    Article  Google Scholar 

  • Thesen A (1977) Measures of the restrictiveness of project networks. Networks 7:193–208

    Article  Google Scholar 

  • Uyttewaal E (2005) Dynamic scheduling with Microsoft Office Project 2003: the book by and for professionals. Co-published with International Institute for Learning Inc, Boca Raton

    Google Scholar 

  • Vanhoucke M (2006b) Work continuity constraints in project scheduling. J Constr Eng Manag 132:14–25

    Article  Google Scholar 

  • Vanhoucke M (2008c) Setup times and fast tracking in resource-constrained project scheduling. Comput Ind Eng 54:1062–1070

    Article  Google Scholar 

  • Vanhoucke M (2010a) Measuring time - Improving project performance using earned value management, vol 136, International series in operations research and management science. Springer, New York

    Google Scholar 

  • Vanhoucke M, Debels D (2008) The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects. Comput Ind Eng 54:140–154

    Article  Google Scholar 

  • Vanhoucke M, Vandevoorde S (2007b) A simulation and evaluation of earned value metrics to forecast the project duration. J Oper Res Soc 58:1361–1374

    Article  Google Scholar 

  • Vanhoucke M, Coelho J, Debels D, Maenhout B, Tavares L (2008) An evaluation of the adequacy of project network generators with systematically sampled networks. Eur J Oper Res 187: 511–524

    Article  Google Scholar 

  • Van Peteghem V, Vanhoucke M (2010a) A genetic algorithm for the preemptive and non-preemtive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201:409–418

    Article  Google Scholar 

  • Van Peteghem V, Vanhoucke M (2010b) Introducing learning effects in resource-constrained project scheduling. Technical report, Ghent University, Ghent, Belgium

    Google Scholar 

  • Wright T (1936) Factors affecting the cost of airplanes. J Aeronaut Sci 3:122–128

    Article  Google Scholar 

  • Yelle L (1979) The learning curves: historical review and comprehensive survey. Decis Sci 10(2):302–328

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Vanhoucke, M. (2013). Resource-Constrained Scheduling Extensions. In: Project Management with Dynamic Scheduling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40438-2_8

Download citation

Publish with us

Policies and ethics