Skip to main content

A Heuristic Procedure For the Multi-mode Project Scheduling Problem Based on Benders’ Decomposition

  • Chapter
Project Scheduling

Abstract

In this paper we consider the problem of determining the starting times of the activities of a project with the objective to minimize the total project duration (makespan). The activities cannot be interrupted once put in progress and are subject to constraints that impose a partial precedence relation among them and a limit to their resource usage. Moreover, the activities can be executed in different modes, involving different durations and resource requirements. This problem is known as Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP), and it is NP-hard being a generalization of the Resource-Constrained Project Scheduling Problem (RCPSP), which is also NP-hard.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Benders J.F. 1962. Partitioning Procedures for Solving Mixed-Variables Programming Problems, Numerische Mathematik, 4, 280–322.

    Article  Google Scholar 

  • Drexl A., Grunewald J. 1993. Nonpreemptive multi-mode resource-constrained project scheduling, HE Transaction, 25(5), 74–81.

    Google Scholar 

  • Elmaghraby S.E. 1977. Activity Networks: Project Planning and Control by network Models, J.Wiley, New York.

    Google Scholar 

  • Kolisch R., Drexl A. 1994. Local Search for Nonpreemptive Multi-Mode Resource Constrained Project Scheduling, Research Report No. 360, Institut fĂĽr Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel.

    Google Scholar 

  • Kolisch R., Sprecher A., Drexl A. 1995. Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems, Management Science, 41(11), 1693–1703.

    Article  Google Scholar 

  • Mingozzi A., Maniezzo V., Ricciardelli S., Bianco L. 1994. An Exact Algorithm for the Resource Constrained Project Scheduling Problem Based on a New Mathematical Formulation (to appear on Management Science, 8, 1998).

    Google Scholar 

  • Patterson J.H. 1973. Alternate Methods of Project Scheduling with Limited Resources, Naval Research Logistics Quarterly, 20, 767–784.

    Article  Google Scholar 

  • Patterson J.H., Slowinsky R., Talbot F.B., Weglarz J. 1989. An algorithm for a general class of precedence and resource constrained scheduling problems, in Slowinsky R., Weglarz J. (Eds), Advances in project scheduling, Elsevier, Amsterdam, 3–28.

    Google Scholar 

  • Slowinski R., Soniewicki B., Weglarz J. 1994. DSS for multiobjective project scheduling subject to multiple-category resource constraints, European Journal of Operational Research, 79, 220–229.

    Article  Google Scholar 

  • Sprecher A., Drexl A. 1996. Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Part I: Theory, Research Report No. 385, Institut fĂĽr Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel.

    Google Scholar 

  • Sprecher A., Drexl A. 1996. Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Part II: Computation, Research Report No. 386, Institut fĂĽr Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel.

    Google Scholar 

  • Sprecher A. 1994. Resource-Constrained Project Scheduling. Exact Methods for the Multi-Mode Case, Lecture Notes in Economics and Mathematical Systems, n. 409, Springer-Verlag, Berlin.

    Google Scholar 

  • Talbot B. 1982. Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case, Management Science, 28, 1197–1210.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Maniezzo, V., Mingozzi, A. (1999). A Heuristic Procedure For the Multi-mode Project Scheduling Problem Based on Benders’ Decomposition. In: Węglarz, J. (eds) Project Scheduling. International Series in Operations Research & Management Science, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5533-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5533-9_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7529-6

  • Online ISBN: 978-1-4615-5533-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics