Harmony Search-Based Hyper-Heuristic For Scheduling Problems
Scheduling problems are encountered in every field which are typically related to services such as in hospital, transportation, and also educational institutions. These problems can be extremely difficult when its involves a large number of events or resources to be scheduled and a wide variety of c...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | http://eprints.usm.my/43658/2/KHAIRUL%20%20ANWAR.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Scheduling problems are encountered in every field which are typically related to services such as in hospital, transportation, and also educational institutions. These problems can be extremely difficult when its involves a large number of events or resources to be scheduled and a wide variety of constraints which need to be satisfied or taken into consideration. Hence, many heuristic and
meta-heuristic approaches have been introduced to solve these problems. However, some institutions look for a method that can deal with a wide range of scheduling
problems without spending a lot of money and times as long the solutions produced are acceptable. |
|---|