Open AccessPengembangan Algoritma Non Delay Pada Kasus Penjadwalan Non-Permutation Hybrid Flowshop Untuk Minimasi Mean Flowtime
Author(s) -
Siti Muhimatul Khoiroh
Publication year - 2018
Publication title -
jurnal teknik industri
Language(s) - English
Resource type - Journals
eISSN - 2527-4112
pISSN - 1978-1431
DOI - 10.22219/jtiumm.vol19.no2.148-156
Subject(s) - flow shop scheduling , permutation (music) , job shop scheduling , scheduling (production processes) , mathematical optimization , computer science , mean flow , algorithm , mathematics , routing (electronic design automation) , computer network , physics , acoustics , turbulence , thermodynamics
Production scheduling is one of the key success factors in the production process. Scheduling approach with Non-Permutation flow shop is a generalization of the traditional scheduling problems Permutation flow shop for the manufacturing industry to allow changing the job on different machines with the flexibility of combinations. This research tries to develop a heuristic approach that is non-delay algorithm by comparing Shortest Processing Time (SPT) and Largest Remaining Time (LRT) in the case of non-permutation flow shop to produce minimum mean flow time ratio. The result of simulation shows that the SPT algorithm gives less mean flow time value compared to LRT algorithm which means that SPT algorithm is better than LRT in case of non-permutation hybrid flow shop.