Logo

Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

Isa, N.A. and Bareduan, S.A. and Zainudin, A.S. and Marsudi, M. (2021) Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem. Journal of Advanced Manufacturing Technology, 15 (1). pp. 39-54.

Full text not available from this repository.

Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

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. © 2021

Item Type:Article
Impact Factor:cited By 0
ID Code:23851
Deposited By: Ms Sharifah Fahimah Saiyed Yeop
Deposited On:19 Aug 2021 13:08
Last Modified:19 Aug 2021 13:08

Repository Staff Only: item control page