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:
书目详细资料
主要作者: Anwar, Khairul
格式: Thesis
语言:English
出版: 2018
主题:
在线阅读:http://eprints.usm.my/43658/2/KHAIRUL%20%20ANWAR.pdf
标签: 添加标签
没有标签, 成为第一个标记此记录!
id my-usm-ep.43658
record_format uketd_dc
spelling my-usm-ep.436582019-04-12T05:24:51Z Harmony Search-Based Hyper-Heuristic For Scheduling Problems 2018-04 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 http://eprints.usm.my/43658/ http://eprints.usm.my/43658/2/KHAIRUL%20%20ANWAR.pdf application/pdf en public phd doctoral Universiti Sains Malaysia Pusat Pengajian Sains Komputer
institution Universiti Sains Malaysia
collection USM Institutional Repository
language English
topic QA75.5-76.95 Electronic computers
Computer science
spellingShingle QA75.5-76.95 Electronic computers
Computer science
Anwar, Khairul
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
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.
format Thesis
qualification_name Doctor of Philosophy (PhD.)
qualification_level Doctorate
author Anwar, Khairul
author_facet Anwar, Khairul
author_sort Anwar, Khairul
title Harmony Search-Based Hyper-Heuristic For Scheduling Problems
title_short 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_sort harmony search-based hyper-heuristic for scheduling problems
granting_institution Universiti Sains Malaysia
granting_department Pusat Pengajian Sains Komputer
publishDate 2018
url http://eprints.usm.my/43658/2/KHAIRUL%20%20ANWAR.pdf
_version_ 1747821256697184256