Track: Undergraduate Student Paper Competition

Abstract

PT. Plasindo Elok is a manufacturer that has been producing plastic protector and packaging system specifically for oil and gas company. All kinds of product which is produced by PT.Plasindo Elok, have the same sequences and at several production stages, there are a number of parallel machine with its different capacity (hybrid flow shop). The existing production scheduling was based on First Come First Serve (FCFS). The objective of this paper is to design a scheduling system to minimize makespan which could reduce WIP and total production cost. Flow shop heuristic method which is used as a basis to get the optimal makespan are NEH and CDS algorithm. Furthermore, the scheduling sequence of NEH and CDS  are used to generate an initial sequence for metaheuristic method, Tabu Search (TS). The result of data processing showed that CDS algorithm represented the minimum makespan compared to NEH algorithm. The proposed methods CDS-TS and NEH-TS, produced the same minimum makespan, 14861,61 minutes with different mean flow time. Both hybrid algorithm (NEH-TS and CDS-TS) could reduce total makespan to 1697,93 minutes or 28,30 hours. The proposed method given to the company was NEH-TS with the production sequence of P10 - P12 - P13 - P8 - P7 - P4 - P5 - P2 - P1 - P11 - P9 - P3 - P14 - P6, NEH-TS was the best algorithm compared to NEH, CDS, and CDS-TS because it produced the least makespan and mean flow time. In addition to facilitate company scheduling calculation, researcher designs a Java based scheduling program.

Keywords

Nawaz, Enscore, and Ham Algorithm (NEH); Campbell Dudek Smith (CDS); Tabu Search Algorithm (TS), Makespan; Software