Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches

The common objectives in permutation flowshop scheduling problem are to minimize the total completion time or formally called as makespan and tardiness. Artificial Bee Colony (ABC) algorithm is one of the methods used to solve the flowshop scheduling problem but only a few researches have been found...

Full description

Saved in:

Bibliographic Details
Main Author:	Mohd Pauzi, Nur Fazlinda
Format:	Thesis
Language:	English English English
Published:	2015
Subjects:	TS155-194 Production management Operations management
Online Access:	http://eprints.uthm.edu.my/1659/2/NUR%20FAZLINDA%20MOHD%20PAUZI%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/1659/1/24p%20NUR%20FAZLINDA%20MOHD%20PAUZI.pdf http://eprints.uthm.edu.my/1659/3/NUR%20FAZLINDA%20MOHD%20PAUZI%20WATERMARK.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uthm-ep.1659
record_format	uketd_dc
spelling	my-uthm-ep.16592021-10-04T08:18:34Z Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches 2015-06 Mohd Pauzi, Nur Fazlinda TS155-194 Production management. Operations management The common objectives in permutation flowshop scheduling problem are to minimize the total completion time or formally called as makespan and tardiness. Artificial Bee Colony (ABC) algorithm is one of the methods used to solve the flowshop scheduling problem but only a few researches have been found using this method in this area. Therefore, ABC algorithm is proposed to solve the flowshop scheduling problem in this research. The main objective of this research is to develop a computer program with capability of manipulating the onlooker bee approaches in ABC Algorithm for solving flowshop scheduling problem. The research also analyzes the performance of the ABC algorithm using three different onlooker bee approaches. A simulation computer program was developed using Visual Basic Editor in Microsoft excel 2007. In this simulation, onlooker bees as the important bee make decision to choose the specific method. The performance of the ABC algorithm was evaluated through three different onlooker approaches i.e. method 3+0+0 (three onlooker bees are dedicated to the best employee bee), method 2+1+0 (two onlooker bees are dedicated to the best employee bee and one onlooker bee is dedicated to second best employee bee) and method 1+1+1 (one onlooker bee is dedicated to each employee bee). All the average percentage makespan difference from three onlooker approaches was compared and the lowest average percentage makespan difference was selected as the best method. The simulation results indicated that method 2+1+0 produces best result at low iterations of 102 and below. At high iterations of 204 and above, method 3+0+0 dominates the best performance. Based on this finding, the selection of the best method can be decided based on the iteration time available. If iteration available is long, method 3+0+0 is more appropriate, otherwise method 2+1+0 is the best choice. The findings from this research can be used by system developer or computer programmer to search the optimum sequence during the manufacturing process and improve the flowshop scheduling. 2015-06 Thesis http://eprints.uthm.edu.my/1659/ http://eprints.uthm.edu.my/1659/2/NUR%20FAZLINDA%20MOHD%20PAUZI%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/1659/1/24p%20NUR%20FAZLINDA%20MOHD%20PAUZI.pdf text en public http://eprints.uthm.edu.my/1659/3/NUR%20FAZLINDA%20MOHD%20PAUZI%20WATERMARK.pdf text en validuser mphil masters Universiti Tun Hussein Onn Malaysia Faculty of Mechanical and Manufacturing Engineering
institution	Universiti Tun Hussein Onn Malaysia
collection	UTHM Institutional Repository
language	English English English
topic	TS155-194 Production management Operations management
spellingShingle	TS155-194 Production management Operations management Mohd Pauzi, Nur Fazlinda Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
description	The common objectives in permutation flowshop scheduling problem are to minimize the total completion time or formally called as makespan and tardiness. Artificial Bee Colony (ABC) algorithm is one of the methods used to solve the flowshop scheduling problem but only a few researches have been found using this method in this area. Therefore, ABC algorithm is proposed to solve the flowshop scheduling problem in this research. The main objective of this research is to develop a computer program with capability of manipulating the onlooker bee approaches in ABC Algorithm for solving flowshop scheduling problem. The research also analyzes the performance of the ABC algorithm using three different onlooker bee approaches. A simulation computer program was developed using Visual Basic Editor in Microsoft excel 2007. In this simulation, onlooker bees as the important bee make decision to choose the specific method. The performance of the ABC algorithm was evaluated through three different onlooker approaches i.e. method 3+0+0 (three onlooker bees are dedicated to the best employee bee), method 2+1+0 (two onlooker bees are dedicated to the best employee bee and one onlooker bee is dedicated to second best employee bee) and method 1+1+1 (one onlooker bee is dedicated to each employee bee). All the average percentage makespan difference from three onlooker approaches was compared and the lowest average percentage makespan difference was selected as the best method. The simulation results indicated that method 2+1+0 produces best result at low iterations of 102 and below. At high iterations of 204 and above, method 3+0+0 dominates the best performance. Based on this finding, the selection of the best method can be decided based on the iteration time available. If iteration available is long, method 3+0+0 is more appropriate, otherwise method 2+1+0 is the best choice. The findings from this research can be used by system developer or computer programmer to search the optimum sequence during the manufacturing process and improve the flowshop scheduling.
format	Thesis
qualification_name	Master of Philosophy (M.Phil.)
qualification_level	Master's degree
author	Mohd Pauzi, Nur Fazlinda
author_facet	Mohd Pauzi, Nur Fazlinda
author_sort	Mohd Pauzi, Nur Fazlinda
title	Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
title_short	Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
title_full	Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
title_fullStr	Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
title_full_unstemmed	Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
title_sort	flowshop scheduling using artificial bee colony (abc) algorithm with varying onlooker bees approaches
granting_institution	Universiti Tun Hussein Onn Malaysia
granting_department	Faculty of Mechanical and Manufacturing Engineering
publishDate	2015
url	http://eprints.uthm.edu.my/1659/2/NUR%20FAZLINDA%20MOHD%20PAUZI%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/1659/1/24p%20NUR%20FAZLINDA%20MOHD%20PAUZI.pdf http://eprints.uthm.edu.my/1659/3/NUR%20FAZLINDA%20MOHD%20PAUZI%20WATERMARK.pdf
_version_	1747830840279171072

Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches

Similar Items