Linear-programming-based heuristics for project capacity planning

Noud Gademann, Johannes M.J. Schutten

Research output: Contribution to journalArticleAcademicpeer-review

23 Citations (Scopus)

Abstract

Many multi-project organizations are capacity driven, which means that their operations are constrained by various scarce resources. An important planning aspect in a capacity driven multi-project organization is capacity planning. By capacity planning, we mean the problem of matching demand for resources and availability of resources for the medium term. Capacity planning is a very useful method to support important tactical decisions such as due date quotation and price quotation for new projects, and to gain an insight into capacity requirements for the medium term. We present a capacity planning model in which aspects such as capacity flexibility, precedence relations between work packages, and maximum work content per period can be taken into account. For this model, we discuss several linear-programming-based heuristics. Using a large set of test instances, we compare these heuristics with some results from the literature. It turns out that some of these heuristics are very powerful for solving capacity planning problems
Original languageUndefined
Pages (from-to)153-165
Number of pages13
JournalIIE transactions
Volume37
Issue number2
DOIs
Publication statusPublished - 2005

Keywords

  • IR-76957
  • METIS-223972

Cite this