请登录 0 购物车
首页 图书 电子图书 期刊 参考文献及会议录 作者,编辑,审稿 A-Z 产品目录
Flexible Automation and Integrated Manufacturing 1999

ISBN 打印: 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.
首页 Begell Digital Portal Begell数据库 期刊 图书 电子图书 参考文献及会议录 作者,编辑,审稿 A-Z 产品目录 订购及政策 关于BegellHouse 联系我们 Language English 中文 Русский 日本語 Português Deutsch Français Español