Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem
This paper proposes a heuristic that introduces the application of bottleneck-based concept at the beginning of an initial sequence determination with the objective of makespan minimization. Earlier studies found that the scheduling activity become complicated when dealing with machine, m greate...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
2021
|
| 主題: | |
| オンライン･アクセス: | http://eprints.uthm.edu.my/2939/1/J12577_4adb3f68f2c5cba610f42e5e2629dbe9.pdf http://eprints.uthm.edu.my/2939/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | This paper proposes a heuristic that introduces the
application of bottleneck-based concept at the beginning of an initial sequence
determination with the objective of makespan minimization. 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 makespan problem in
scheduling environment. Thus, this study treated the NEH heuristic as the
highest ranking and most suitable heuristic for evaluation purpose since it is
the best performing heuristic in makespan minimization. This study used the
bottleneck-based approach to identify the critical processing machine which
led to high completion time. In this study, an experiment involving machines
(m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple
Programming to solve the permutation flowshop scheduling problem. The
overall computational results demonstrated that the bottleneck machine M4
performed the best in minimizing the makespan for all data set of problems. |
|---|