Penerapan Algoritma Elephant Herding Optimization (EHO) pada Masalah Hybrid Flowshop Scheduling (HFS)

Abstract

The industry is the driving force for the economy in Indonesia. One of the problems faced by industrial companies in the production process is determining the production schedule. The production schedule that is not according to the specified target can cause losses to the company. Scheduling is the allocation of resources to carry out a set of work at a specified time. The problem solved in this article is hybrid flowshop scheduling (HFS); companies in bread making will be using it. A solution to solve the HFS problem using elephant herding optimization (EHO) algorithm. For the company to complete the production process by minimizing makespan, effective scheduling is needed, taking into account the number of parallel machines. This article experimented with nine (9) jobs and seven (7) stages of the production process. The results of this article makespan 11.270 seconds using the MATLAB software. EHO algorithm program on HFS problem can minimize time for 36 minutes 39 seconds.