Harmony Search-Based Hyper-Heuristic For Scheduling Problems

Anwar, Khairul (2018) Harmony Search-Based Hyper-Heuristic For Scheduling Problems. PhD thesis, Universiti Sains Malaysia.

Download (1MB) | Preview


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.

Item Type: Thesis (PhD)
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Pusat Pengajian Sains Komputer (School of Computer Sciences) > Thesis
Depositing User: ASM Ab Shukor Mustapa
Date Deposited: 15 Mar 2019 02:33
Last Modified: 12 Apr 2019 05:24
URI: http://eprints.usm.my/id/eprint/43658

Actions (login required)

View Item View Item