Customer Login 0 Shopping Cart
Home Books eBooks Journals References and Proceedings Authors, Editors, Reviewers A-Z Product Index
Flexible Automation and Integrated Manufacturing 1999

ISBN Print: 978-1-56700-133-4

MULTI-PROJECT ROUGH-CUT CAPACITY PLANNING

Abstract

In many multi-project organizations, there is a clear need of hierarchical capacity planning. In the early stages of a project, only rough estimates of capacity requirements are available. For this purpose, we introduce the multi-project rough cut capacity planning problem. This problem aims to minimize the use of non-regular capacity, where capacity requirements are only stated in time units (e.g man hours). In addition several constraints must be satisfied, represented by precedence relations, time windows, and minimum durations. We propose two heuristic algorithms and show computational results for problems with different characteristics. Finally, we discuss the potential use of these algorithms for some extensions to the multi-project rough cut capacity planning problem, as defined here.
Home Begell Digital Portal Begell Digital Library Journals Books eBooks References and Proceedings Authors, Editors, Reviewers A-Z Product Index Prices and Subscription Policies About Begell House Contact Us Language English 中文 Русский 日本語 Português Deutsch Français Español