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...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| 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!
|
| Summary: | 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. |
|---|