Solving security staff scheduling by using genetic algorithm

The scheduling problem has been studied for a few decades where many researchers have successfully solved scheduling using different approaches. However, in the new era, flexible working hours is the latest trend compared with the traditional way, fixed working hours. Therefore, in this research, a...

Full description

Saved in:
Bibliographic Details
Main Author: Ang, Shin Yin
Format: Thesis
Language:English
English
English
Published: 2021
Subjects:
Online Access:http://eprints.uthm.edu.my/1091/1/24p%20ANG%20SHIN%20YIN.pdf
http://eprints.uthm.edu.my/1091/2/ANG%20SHIN%20YIN%20COPYRIGHT%20DECLARATION.pdf
http://eprints.uthm.edu.my/1091/3/ANG%20SHIN%20YIN%20WATERMARK.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uthm-ep.1091
record_format uketd_dc
spelling my-uthm-ep.10912021-08-22T08:39:10Z Solving security staff scheduling by using genetic algorithm 2021-03 Ang, Shin Yin TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television The scheduling problem has been studied for a few decades where many researchers have successfully solved scheduling using different approaches. However, in the new era, flexible working hours is the latest trend compared with the traditional way, fixed working hours. Therefore, in this research, a flexible shift scheduling is studied because the scheduling problem should be humanized to follow the trend. But, it is a complex problem due to the scheduling involving the staff and their preferences. A heuristic method, the genetic algorithm is selected to solve this research problem as it is a powerful tool, shown in addressing the scheduling problem. It is because it is familiar used to solve large scale population and able to produce an optimal solution. This research not only fulfils the demand of shift but also calculates the preference of staff toward shift as the hard constraints. The combination of gender, preferred shift and preferred day off of the staff are represented as the gene while the chromosome represents a schedule. From the existing method, it requires the user to collect and key in the preference of staff manually before generating a result. It may take longer time if there have a larger number of staff. From the result in this research, 76.37% of the staff were allocated at their preferred shift while only 23.63% of staff were not allocated at their preferred shift. This research also proposed an offline system, known as the Flexible Shift Scheduling System to smooth the job. In the sensitivity analysis, the system could provide a satisfactory result in three minutes. 2021-03 Thesis http://eprints.uthm.edu.my/1091/ http://eprints.uthm.edu.my/1091/1/24p%20ANG%20SHIN%20YIN.pdf text en public http://eprints.uthm.edu.my/1091/2/ANG%20SHIN%20YIN%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/1091/3/ANG%20SHIN%20YIN%20WATERMARK.pdf text en validuser mphil masters Universiti Tun Hussein Onn Malaysia Faculty of Applied Science and Technology
institution Universiti Tun Hussein Onn Malaysia
collection UTHM Institutional Repository
language English
English
English
topic TK5101-6720 Telecommunication
Including telegraphy, telephone, radio, radar, television
spellingShingle TK5101-6720 Telecommunication
Including telegraphy, telephone, radio, radar, television
Ang, Shin Yin
Solving security staff scheduling by using genetic algorithm
description The scheduling problem has been studied for a few decades where many researchers have successfully solved scheduling using different approaches. However, in the new era, flexible working hours is the latest trend compared with the traditional way, fixed working hours. Therefore, in this research, a flexible shift scheduling is studied because the scheduling problem should be humanized to follow the trend. But, it is a complex problem due to the scheduling involving the staff and their preferences. A heuristic method, the genetic algorithm is selected to solve this research problem as it is a powerful tool, shown in addressing the scheduling problem. It is because it is familiar used to solve large scale population and able to produce an optimal solution. This research not only fulfils the demand of shift but also calculates the preference of staff toward shift as the hard constraints. The combination of gender, preferred shift and preferred day off of the staff are represented as the gene while the chromosome represents a schedule. From the existing method, it requires the user to collect and key in the preference of staff manually before generating a result. It may take longer time if there have a larger number of staff. From the result in this research, 76.37% of the staff were allocated at their preferred shift while only 23.63% of staff were not allocated at their preferred shift. This research also proposed an offline system, known as the Flexible Shift Scheduling System to smooth the job. In the sensitivity analysis, the system could provide a satisfactory result in three minutes.
format Thesis
qualification_name Master of Philosophy (M.Phil.)
qualification_level Master's degree
author Ang, Shin Yin
author_facet Ang, Shin Yin
author_sort Ang, Shin Yin
title Solving security staff scheduling by using genetic algorithm
title_short Solving security staff scheduling by using genetic algorithm
title_full Solving security staff scheduling by using genetic algorithm
title_fullStr Solving security staff scheduling by using genetic algorithm
title_full_unstemmed Solving security staff scheduling by using genetic algorithm
title_sort solving security staff scheduling by using genetic algorithm
granting_institution Universiti Tun Hussein Onn Malaysia
granting_department Faculty of Applied Science and Technology
publishDate 2021
url http://eprints.uthm.edu.my/1091/1/24p%20ANG%20SHIN%20YIN.pdf
http://eprints.uthm.edu.my/1091/2/ANG%20SHIN%20YIN%20COPYRIGHT%20DECLARATION.pdf
http://eprints.uthm.edu.my/1091/3/ANG%20SHIN%20YIN%20WATERMARK.pdf
_version_ 1747830735848341504