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...

Full description

Bibliographic Details
Main Author: Anwar, Khairul
Format: Thesis
Language:English
Published: 2018
Subjects:
Online Access:http://eprints.usm.my/43658/
http://eprints.usm.my/43658/2/KHAIRUL%20%20ANWAR.pdf
_version_ 1848879865644711936
author Anwar, Khairul
author_facet Anwar, Khairul
author_sort Anwar, Khairul
building USM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T17:54:01Z
format Thesis
id usm-43658
institution Universiti Sains Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T17:54:01Z
publishDate 2018
recordtype eprints
repository_type Digital Repository
spelling usm-436582019-04-12T05:24:51Z http://eprints.usm.my/43658/ Harmony Search-Based Hyper-Heuristic For Scheduling Problems Anwar, Khairul QA75.5-76.95 Electronic computers. Computer science 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. 2018-04 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/43658/2/KHAIRUL%20%20ANWAR.pdf Anwar, Khairul (2018) Harmony Search-Based Hyper-Heuristic For Scheduling Problems. PhD thesis, Universiti Sains Malaysia.
spellingShingle QA75.5-76.95 Electronic computers. Computer science
Anwar, Khairul
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
title Harmony Search-Based Hyper-Heuristic For Scheduling Problems
title_full Harmony Search-Based Hyper-Heuristic For Scheduling Problems
title_fullStr Harmony Search-Based Hyper-Heuristic For Scheduling Problems
title_full_unstemmed Harmony Search-Based Hyper-Heuristic For Scheduling Problems
title_short Harmony Search-Based Hyper-Heuristic For Scheduling Problems
title_sort harmony search-based hyper-heuristic for scheduling problems
topic QA75.5-76.95 Electronic computers. Computer science
url http://eprints.usm.my/43658/
http://eprints.usm.my/43658/2/KHAIRUL%20%20ANWAR.pdf