Open AccessBottleneck-Based Heuristic for Permutation Flowshop Scheduling
Author(s) -
N.A. Isa,
Salleh Ahmad Bareduan,
A.S. Zainudin
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/824/1/012020
Subject(s) - bottleneck , job shop scheduling , heuristic , computer science , permutation (music) , scheduling (production processes) , mathematical optimization , flow shop scheduling , minification , algorithm , mathematics , artificial intelligence , routing (electronic design automation) , physics , acoustics , embedded system , computer network
This paper addresses the permutation flowshop scheduling problem with objective of makespan minimization. It proposes a heuristic that apply bottleneck-based identification technique and Nawaz, Enscore and Ham (NEH) insertion technique. This experiment was carried out using measurement of four-machines and six-jobs simulated in Microsoft Excel Simple Programming. The computational result show that bottleneck-based (BNB) achieved 60 % and more of optimum solution and heuristic validation result prove that the proposed heuristic resulting to be much better than existing heuristic by achieving more best solution of 6 sets out of 10 sets replication.