Bottleneck-based heuristic for permutation flowshop scheduling

The newly heuristic is developed by introducing the bottleneck-based concept that was applied at the beginning of initial solution determination. The heuristic is known as Bottleneck-Based (BNB) heuristic. The previous study found that the scheduling activity become complex when dealing with large n...

Full description

Saved in:

Bibliographic Details
Main Author:	Isa, Noor Amira
Format:	Thesis
Language:	English English English
Published:	2017
Subjects:	QA Mathematics QA150-272.5 Algebra
Online Access:	http://eprints.uthm.edu.my/837/1/24p%20NOOR%20AMIRA%20ISA.pdf http://eprints.uthm.edu.my/837/2/NOOR%20AMIRA%20ISA%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/837/3/NOOR%20AMIRA%20ISA%20WATERMARK.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uthm-ep.837
record_format	uketd_dc
spelling	my-uthm-ep.8372021-09-06T02:48:32Z Bottleneck-based heuristic for permutation flowshop scheduling 2017-08 Isa, Noor Amira QA Mathematics QA150-272.5 Algebra The newly heuristic is developed by introducing the bottleneck-based concept that was applied at the beginning of initial solution determination. The heuristic is known as Bottleneck-Based (BNB) heuristic. The previous study found that the scheduling activity become complex when dealing with large number of machine, m > 2, it is NP-hardness. Thus, the main objective of this study are to propose and develop a new heuristic for solving permutation flowshop scheduling by considering four-machines and n-jobs (n = 6, 10, 15, 20). Three phases were applied into this study in order to boost the makespan performance of the proposed heuristic. Two phases (bottleneck identification phase and initial sequence arrangement phase) were newly introduced and combined with the existing famous Nawaz, Enscore and Ham (NEH) insertion technique. There are four potential dominant machines (M1, M2, M3, M4) clustered as bottleneck machines. A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). The heuristic performance was evaluated based on the average makespan ratio, average percentage error, and percentage of solution performance obtained. This study considered the NEH heuristic as the best and appropriate tool for comparison purpose since NEH heuristic is the best performing heuristic in minimizing the makespan. The heuristic evaluation result showed that the BNB heuristic is performing better than the NEH at bottleneck machines M1, M3 and M4. While, heuristic verification result showed that the bottleneck algorithms performed the best in minimizing the makespan for set of problems with bottleneck machine M4. However, the overall result showed fluctuate values over the size of jobs. The result of this study shown that the developed BNB heuristic achieved good performance in solving small sized problems however further modification is needed for medium and large sized problems. 2017-08 Thesis http://eprints.uthm.edu.my/837/ http://eprints.uthm.edu.my/837/1/24p%20NOOR%20AMIRA%20ISA.pdf text en public http://eprints.uthm.edu.my/837/2/NOOR%20AMIRA%20ISA%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/837/3/NOOR%20AMIRA%20ISA%20WATERMARK.pdf text en validuser mphil masters Universiti Tun Hussein Onn Malaysia Fakulti Kejuruteraan Mekanikal dan Pembuatan
institution	Universiti Tun Hussein Onn Malaysia
collection	UTHM Institutional Repository
language	English English English
topic	QA Mathematics QA150-272.5 Algebra
spellingShingle	QA Mathematics QA150-272.5 Algebra Isa, Noor Amira Bottleneck-based heuristic for permutation flowshop scheduling
description	The newly heuristic is developed by introducing the bottleneck-based concept that was applied at the beginning of initial solution determination. The heuristic is known as Bottleneck-Based (BNB) heuristic. The previous study found that the scheduling activity become complex when dealing with large number of machine, m > 2, it is NP-hardness. Thus, the main objective of this study are to propose and develop a new heuristic for solving permutation flowshop scheduling by considering four-machines and n-jobs (n = 6, 10, 15, 20). Three phases were applied into this study in order to boost the makespan performance of the proposed heuristic. Two phases (bottleneck identification phase and initial sequence arrangement phase) were newly introduced and combined with the existing famous Nawaz, Enscore and Ham (NEH) insertion technique. There are four potential dominant machines (M1, M2, M3, M4) clustered as bottleneck machines. A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). The heuristic performance was evaluated based on the average makespan ratio, average percentage error, and percentage of solution performance obtained. This study considered the NEH heuristic as the best and appropriate tool for comparison purpose since NEH heuristic is the best performing heuristic in minimizing the makespan. The heuristic evaluation result showed that the BNB heuristic is performing better than the NEH at bottleneck machines M1, M3 and M4. While, heuristic verification result showed that the bottleneck algorithms performed the best in minimizing the makespan for set of problems with bottleneck machine M4. However, the overall result showed fluctuate values over the size of jobs. The result of this study shown that the developed BNB heuristic achieved good performance in solving small sized problems however further modification is needed for medium and large sized problems.
format	Thesis
qualification_name	Master of Philosophy (M.Phil.)
qualification_level	Master's degree
author	Isa, Noor Amira
author_facet	Isa, Noor Amira
author_sort	Isa, Noor Amira
title	Bottleneck-based heuristic for permutation flowshop scheduling
title_short	Bottleneck-based heuristic for permutation flowshop scheduling
title_full	Bottleneck-based heuristic for permutation flowshop scheduling
title_fullStr	Bottleneck-based heuristic for permutation flowshop scheduling
title_full_unstemmed	Bottleneck-based heuristic for permutation flowshop scheduling
title_sort	bottleneck-based heuristic for permutation flowshop scheduling
granting_institution	Universiti Tun Hussein Onn Malaysia
granting_department	Fakulti Kejuruteraan Mekanikal dan Pembuatan
publishDate	2017
url	http://eprints.uthm.edu.my/837/1/24p%20NOOR%20AMIRA%20ISA.pdf http://eprints.uthm.edu.my/837/2/NOOR%20AMIRA%20ISA%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/837/3/NOOR%20AMIRA%20ISA%20WATERMARK.pdf
_version_	1747830690497429504

Bottleneck-based heuristic for permutation flowshop scheduling

Similar Items