カスタマーログイン 0 ショッピングカート
ホーム 書籍 電子書籍 ジャーナル 参考文献と会報 著者、編集者、レビュー者 A-Z商品インデックス
Flexible Automation and Integrated Manufacturing 1999

ISBN 印刷: 978-1-56700-133-4

MULTI-PROJECT ROUGH-CUT CAPACITY PLANNING

要約

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.
ホーム Begell Digital Portal Begellデジタルライブラリー ジャーナル 書籍 電子書籍 参考文献と会報 著者、編集者、レビュー者 A-Z商品インデックス 価格及び購読のポリシー Begell Houseの概要 連絡先 Language English 中文 Русский 日本語 Português Deutsch Français Español