Skip to main content

Linear-programming-based heuristics for project capacity planning

Buy Article:

$60.90 plus tax (Refund Policy)

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.

Document Type: Research Article

DOI: http://dx.doi.org/10.1080/07408170590885611

Affiliations: ORTEC bv, P.O. Box 490, 2800, Gouda, AL, The Netherlands

Publication date: February 1, 2005

tandf/uiie/2005/00000037/00000002/art00005
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more