Dynamic weighted idle time heuristic for flowshop scheduling

The constructive heuristic of Nawaz, Enscore and Ham (NEH) has been introduced in 1983 to solve flowshop scheduling. Many researchers have continued to improve the NEH by adding new steps and procedures to the existing algorithm. Thus, this study has developed a new heuristic known as Dynamic Weight...

Full description

Saved in:

Bibliographic Details
Main Author:	Zainudin, Amira Syuhada
Format:	Thesis
Language:	English English English
Published:	2017
Subjects:	TS155-194 Production management Operations management
Online Access:	http://eprints.uthm.edu.my/742/1/24p%20AMIRA%20SYUHADA%20ZAINUDIN.pdf http://eprints.uthm.edu.my/742/2/AMIRA%20SYUHADA%20ZAINUDIN%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/742/3/AMIRA%20SYUHADA%20ZAINUDIN%20%20WATERMARK.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uthm-ep.742
record_format	uketd_dc
spelling	my-uthm-ep.7422021-08-30T07:35:52Z Dynamic weighted idle time heuristic for flowshop scheduling 2017-08 Zainudin, Amira Syuhada TS155-194 Production management. Operations management The constructive heuristic of Nawaz, Enscore and Ham (NEH) has been introduced in 1983 to solve flowshop scheduling. Many researchers have continued to improve the NEH by adding new steps and procedures to the existing algorithm. Thus, this study has developed a new heuristic known as Dynamic Weighted Idle Time (DWIT) method by adding dynamic weight factors for solving the partial solution with purpose to obtain optimal makespan and improve the NEH heuristic. The objective of this study are to develop a DWIT heuristic to solve flowshop scheduling problem and to assess the performance of the new DWIT heuristic against the current best scheduling heuristic, ie the NEH. This research developed a computer programming in Microsoft Excel to measure the flowshop scheduling performance for every change of weight factors. The performance measure is done by using n jobs (n=6,10 and 20) and 4 machines. The weight factors were applied with numerical method within the range of zero to one. Different weight factors and machines idle time were used at different problem sizes. For 6 jobs and 4 machines, only idle time before and in between two jobs were used while for 10 jobs and 20 jobs the consideration of idle time was idle time before, in between two jobs and after completion of the last job. In 6 jobs problem, the result was compared between DWIT against Optimum and NEH against Optimum. While in 10 jobs and 20 jobs problem the result was compared between DWIT against the NEH. Overall result shows that the result on 6 and 10 jobs problem the DWIT heuristic obtained better results than NEH heuristic. However, in 20 jobs problem, the result shows that the NEH was better than DWIT. The result of this study can be used for further research in modifying the weight factors and idle time selections in order to improve the NEH heuristic. 2017-08 Thesis http://eprints.uthm.edu.my/742/ http://eprints.uthm.edu.my/742/1/24p%20AMIRA%20SYUHADA%20ZAINUDIN.pdf text en public http://eprints.uthm.edu.my/742/2/AMIRA%20SYUHADA%20ZAINUDIN%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/742/3/AMIRA%20SYUHADA%20ZAINUDIN%20%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	TS155-194 Production management Operations management
spellingShingle	TS155-194 Production management Operations management Zainudin, Amira Syuhada Dynamic weighted idle time heuristic for flowshop scheduling
description	The constructive heuristic of Nawaz, Enscore and Ham (NEH) has been introduced in 1983 to solve flowshop scheduling. Many researchers have continued to improve the NEH by adding new steps and procedures to the existing algorithm. Thus, this study has developed a new heuristic known as Dynamic Weighted Idle Time (DWIT) method by adding dynamic weight factors for solving the partial solution with purpose to obtain optimal makespan and improve the NEH heuristic. The objective of this study are to develop a DWIT heuristic to solve flowshop scheduling problem and to assess the performance of the new DWIT heuristic against the current best scheduling heuristic, ie the NEH. This research developed a computer programming in Microsoft Excel to measure the flowshop scheduling performance for every change of weight factors. The performance measure is done by using n jobs (n=6,10 and 20) and 4 machines. The weight factors were applied with numerical method within the range of zero to one. Different weight factors and machines idle time were used at different problem sizes. For 6 jobs and 4 machines, only idle time before and in between two jobs were used while for 10 jobs and 20 jobs the consideration of idle time was idle time before, in between two jobs and after completion of the last job. In 6 jobs problem, the result was compared between DWIT against Optimum and NEH against Optimum. While in 10 jobs and 20 jobs problem the result was compared between DWIT against the NEH. Overall result shows that the result on 6 and 10 jobs problem the DWIT heuristic obtained better results than NEH heuristic. However, in 20 jobs problem, the result shows that the NEH was better than DWIT. The result of this study can be used for further research in modifying the weight factors and idle time selections in order to improve the NEH heuristic.
format	Thesis
qualification_name	Master of Philosophy (M.Phil.)
qualification_level	Master's degree
author	Zainudin, Amira Syuhada
author_facet	Zainudin, Amira Syuhada
author_sort	Zainudin, Amira Syuhada
title	Dynamic weighted idle time heuristic for flowshop scheduling
title_short	Dynamic weighted idle time heuristic for flowshop scheduling
title_full	Dynamic weighted idle time heuristic for flowshop scheduling
title_fullStr	Dynamic weighted idle time heuristic for flowshop scheduling
title_full_unstemmed	Dynamic weighted idle time heuristic for flowshop scheduling
title_sort	dynamic weighted idle time heuristic for flowshop scheduling
granting_institution	Universiti Tun Hussein Onn Malaysia
granting_department	Fakulti Kejuruteraan Mekanikal dan Pembuatan
publishDate	2017
url	http://eprints.uthm.edu.my/742/1/24p%20AMIRA%20SYUHADA%20ZAINUDIN.pdf http://eprints.uthm.edu.my/742/2/AMIRA%20SYUHADA%20ZAINUDIN%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/742/3/AMIRA%20SYUHADA%20ZAINUDIN%20%20WATERMARK.pdf
_version_	1747830671851651072

Dynamic weighted idle time heuristic for flowshop scheduling

Similar Items