書誌事項
- タイトル別名
-
- Multi-Project Planning with Time Constraints
- ジカン セイヤク ツキ プロジェクト ケイカクホウ
この論文をさがす
説明
We consider a multi-project scheduling problem with time constraints on resources, which appear in the planning of new projects that need to use the same resources as other projects under execution. We seek the optimal sequence of activities and the shortest completion time for all projects taken together. We propose a solution procedure using a branch and bound method for small size problems, where the bounding operations are established by a lower bound as well as an equivalence relation between the sequences of activities. An approximate solution by heuristics is required because of the high computational complexity. The approximate solutions obtained by eight heuristic rules are compared with the shortest completion times by using randomly generated simulating problems. We conclude that an earliest finishing time order rule provides effective heuristic rules for multi-project planning with time constraints on resources; however, a latest finishing time order rule is effective for a large-scale project.
収録刊行物
-
- システム制御情報学会論文誌
-
システム制御情報学会論文誌 9 (1), 34-40, 1996
一般社団法人 システム制御情報学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390282680141574400
-
- NII論文ID
- 10004335439
-
- NII書誌ID
- AN1013280X
-
- ISSN
- 2185811X
- 13425668
- http://id.crossref.org/issn/00138444
-
- NDL書誌ID
- 3915470
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可