Linear-programming-based heuristics for project capacity planning

A.J.R.M. Gademann, J.M.J. Schutten

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

28 Citaten (Scopus)

Samenvatting

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. Linear-programming-based heuristics for project capacity planning - ResearchGate. Available from: http://www.researchgate.net/publication/228898037_Linear-programming-based_heuristics_for_project_capacity_planning [accessed Oct 30, 2015].
Originele taal-2Engels
Pagina's (van-tot)153-165
TijdschriftIIE Transactions
Volume37
Nummer van het tijdschrift2
DOI's
StatusGepubliceerd - 2005

Vingerafdruk

Duik in de onderzoeksthema's van 'Linear-programming-based heuristics for project capacity planning'. Samen vormen ze een unieke vingerafdruk.

Citeer dit