Linear-programming-based heuristics for project capacity planning.: An article from: IIE Transactions

This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on February 1, 2005. The length of the article is 12827 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

From the author: 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.

Citation Details
Title: Linear-programming-based heuristics for project capacity planning.
Author: Noud Gademann
Publication:IIE Transactions (Refereed)
Date: February 1, 2005
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: 37 Issue: 2 Page: 153(13)

Distributed by Thomson Gale