Hybrid evolutionary algorithm for multi-mode resource-constrained project scheduling problem
Scheduling problem is ubiquitous in many industries. However, real industrial scheduling problem can sometimes become too complicated. Therefore, specific problems are formulated as instances that can be studied in detail; one of which is known as the Multi-mode Resource-Constrained Project Scheduli...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2011
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/44142 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | Scheduling problem is ubiquitous in many industries. However, real industrial scheduling problem can sometimes become too complicated. Therefore, specific problems are formulated as instances that can be studied in detail; one of which is known as the Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP). Solving MRCPSP itself is very challenging since, up to now, no polynomial approach is able to solve it optimally.
In MRCPSP, a project has a list of non-preemptable activities; each of them is to be
executed in one of the several modes representing a relation between resources
requirement and execution duration. The schedule has to be precedence-feasible as
well as resource-feasible. |
|---|