PENDEKATAN ALGORITMA CROSS ENTROPY-GENETIC ALGORITHM UNTUK MENURUNKAN MAKESPAN PADA PENJADWALAN FLOW SHOP

Abstract

In the flow shop scheduling each job will go through every machine in the same order. The goal of this research is to complete a series of jobs in order to obtain the optimal makespan for stick skewers rounding machine. It is become necessities because the company has no planning and scheduling, while the demand exceeds the capacity Thus, optimize the scheduling is needed to be done. One way to optimize the scheduling is to minimize makespan. Based on the results of the research Cross Entropy Algorithm-Genetic Algorithm (CEGA) can provide the optimal solution. This