Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems

Permutation flow shop problem (PFSP) is one of the commonly reviewed machine environments in scheduling problems. The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in f...

Full description

Saved in:

Bibliographic Details
Main Author:	Chong, Zheng Ziao
Format:	Thesis
Language:	English
Published:	2015
Subjects:	TJ1-1570 Mechanical engineering and machinery
Online Access:	http://eprints.usm.my/41022/1/CHONG_ZHENG_ZIAO_24_Pages.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-usm-ep.41022
record_format	uketd_dc
spelling	my-usm-ep.410222018-07-12T08:01:42Z Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems 2015 Chong, Zheng Ziao TJ1-1570 Mechanical engineering and machinery Permutation flow shop problem (PFSP) is one of the commonly reviewed machine environments in scheduling problems. The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in flow shops. Throughout the past 30 years, the NEH heuristics developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. Due to these findings, NEH heuristics is selected as the basis of this study. Modification is done to enhance the objectives of this study, which is makespan and idle time reduction. In this study, a total of 109 flow-shop problems were solved with the number of machines and jobs being set at a range of 4 to 25. 100 problems were carried out using numerical assessments. The process times of the jobs were randomly generated within the range of 1 to 10 using Excel spreadsheets. Whereas the remaining 9 sets of tests were carried out using real world case studies. In each case study, the company involved was provided with a surface mounting technology (SMT) service. It has the capability of planning schedules by adopting the backward scheduling technique. The proposed heuristic, NEH-M will be compared to both the historical production schedule and NEH schedule in order to verify and validate the performance of the proposed idea. The performance of the NEH-M heuristics was computed using the error deviation (ED) formula. The generated results gained through Excel modeling show that the NEH-M heuristics outperforms the historical production schedule in all conditions. On the other hand, when the NEH-M heuristics is compared to the NEH heuristics, the overall performance of makespan reduction is underperforming while the overall performance of idle time reduction is over performing when there are large numbers of machines and jobs. 2015 Thesis http://eprints.usm.my/41022/ http://eprints.usm.my/41022/1/CHONG_ZHENG_ZIAO_24_Pages.pdf application/pdf en public masters Universiti Sains Malaysia Pusat Pengajian Kejuruteraan Mekanik
institution	Universiti Sains Malaysia
collection	USM Institutional Repository
language	English
topic	TJ1-1570 Mechanical engineering and machinery
spellingShingle	TJ1-1570 Mechanical engineering and machinery Chong, Zheng Ziao Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
description	Permutation flow shop problem (PFSP) is one of the commonly reviewed machine environments in scheduling problems. The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in flow shops. Throughout the past 30 years, the NEH heuristics developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. Due to these findings, NEH heuristics is selected as the basis of this study. Modification is done to enhance the objectives of this study, which is makespan and idle time reduction. In this study, a total of 109 flow-shop problems were solved with the number of machines and jobs being set at a range of 4 to 25. 100 problems were carried out using numerical assessments. The process times of the jobs were randomly generated within the range of 1 to 10 using Excel spreadsheets. Whereas the remaining 9 sets of tests were carried out using real world case studies. In each case study, the company involved was provided with a surface mounting technology (SMT) service. It has the capability of planning schedules by adopting the backward scheduling technique. The proposed heuristic, NEH-M will be compared to both the historical production schedule and NEH schedule in order to verify and validate the performance of the proposed idea. The performance of the NEH-M heuristics was computed using the error deviation (ED) formula. The generated results gained through Excel modeling show that the NEH-M heuristics outperforms the historical production schedule in all conditions. On the other hand, when the NEH-M heuristics is compared to the NEH heuristics, the overall performance of makespan reduction is underperforming while the overall performance of idle time reduction is over performing when there are large numbers of machines and jobs.
format	Thesis
qualification_level	Master's degree
author	Chong, Zheng Ziao
author_facet	Chong, Zheng Ziao
author_sort	Chong, Zheng Ziao
title	Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
title_short	Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
title_full	Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
title_fullStr	Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
title_full_unstemmed	Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
title_sort	modified neh heuristic on makespan reduction in permutation flow shop problems
granting_institution	Universiti Sains Malaysia
granting_department	Pusat Pengajian Kejuruteraan Mekanik
publishDate	2015
url	http://eprints.usm.my/41022/1/CHONG_ZHENG_ZIAO_24_Pages.pdf
_version_	1747820862594088960

Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems

Similar Items