On constructing stable project baseline schedules with time constraints
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 96 === In this thesis, we first propose a random project scheduling network generator by integrating additional time window or time schedule constraints with a popular project network generator (RanGen). We then give two polynomial heuristic algorithms (Greedy I a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83475717697428706085 |