Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling

This paper proposes a new heuristic that introduces the method of bottleneck-based (BNB) at the beginning of an initial sequence determination with the objective of make span minimization for large size problem. Earlier studies found that the scheduling activity become complicated when dealing with...

Full description

Saved in:
Bibliographic Details
Main Authors: Isa, Noor Amira, Ahmad Bareduan, Salleh
Other Authors: Ismail, Al Emran
Format: Book Section
Language:English
Published: Penerbit UTHM 2020
Subjects:
Online Access:http://eprints.uthm.edu.my/3095/1/Ch07.pdf
http://eprints.uthm.edu.my/3095/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uthm.eprints.3095
record_format eprints
spelling my.uthm.eprints.30952022-01-03T07:48:02Z http://eprints.uthm.edu.my/3095/ Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling Isa, Noor Amira Ahmad Bareduan, Salleh TJ Mechanical engineering and machinery TL500-777 Aeronautics. Aeronautical engineering This paper proposes a new heuristic that introduces the method of bottleneck-based (BNB) at the beginning of an initial sequence determination with the objective of make span minimization for large size problem. Earlier studies found that the scheduling activity become complicated when dealing with machine, m greater than 2, known as non-deterministic polynomial-time hardness (NP-hard). To date, the Nawaz-Enscore-Ham (NEH) algorithm is still recognized as the best heuristic in solving make span problem in scheduling environment. A very detail step by step methodology to develop the BNB heuristic was thoroughly discussed and elaborated in this paper. This study used the bottleneck-based concept to identify the critical processing machine which lead to high completion time which known as bottleneck machine. The process times at the bottleneck machine were then used to establish an initial sequence arrangement. This is followed by insertion technique applied at the partial sequences until a complete schedule is obtained. It was observed that the developed BNB heuristic has the capability to produce better results than the NEH in specific identified bottleneck machines. Penerbit UTHM Ismail, Al Emran 2020 Book Section PeerReviewed text en http://eprints.uthm.edu.my/3095/1/Ch07.pdf Isa, Noor Amira and Ahmad Bareduan, Salleh (2020) Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling. In: Advances in Mechanical, Manufacturing and Aerospace Engineering. Penerbit UTHM, pp. 98-114. ISBN 978-967-2916-56-7
institution Universiti Tun Hussein Onn Malaysia
building UTHM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Tun Hussein Onn Malaysia
content_source UTHM Institutional Repository
url_provider http://eprints.uthm.edu.my/
language English
topic TJ Mechanical engineering and machinery
TL500-777 Aeronautics. Aeronautical engineering
spellingShingle TJ Mechanical engineering and machinery
TL500-777 Aeronautics. Aeronautical engineering
Isa, Noor Amira
Ahmad Bareduan, Salleh
Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
description This paper proposes a new heuristic that introduces the method of bottleneck-based (BNB) at the beginning of an initial sequence determination with the objective of make span minimization for large size problem. Earlier studies found that the scheduling activity become complicated when dealing with machine, m greater than 2, known as non-deterministic polynomial-time hardness (NP-hard). To date, the Nawaz-Enscore-Ham (NEH) algorithm is still recognized as the best heuristic in solving make span problem in scheduling environment. A very detail step by step methodology to develop the BNB heuristic was thoroughly discussed and elaborated in this paper. This study used the bottleneck-based concept to identify the critical processing machine which lead to high completion time which known as bottleneck machine. The process times at the bottleneck machine were then used to establish an initial sequence arrangement. This is followed by insertion technique applied at the partial sequences until a complete schedule is obtained. It was observed that the developed BNB heuristic has the capability to produce better results than the NEH in specific identified bottleneck machines.
author2 Ismail, Al Emran
author_facet Ismail, Al Emran
Isa, Noor Amira
Ahmad Bareduan, Salleh
format Book Section
author Isa, Noor Amira
Ahmad Bareduan, Salleh
author_sort Isa, Noor Amira
title Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
title_short Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
title_full Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
title_fullStr Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
title_full_unstemmed Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
title_sort methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
publisher Penerbit UTHM
publishDate 2020
url http://eprints.uthm.edu.my/3095/1/Ch07.pdf
http://eprints.uthm.edu.my/3095/
_version_ 1738581081078104064
score 13.211869