Open AccessComparison of first come first served and ant colony algorithm method for door leaf production scheduling
Author(s) -
Ukurta Tarigan,
Ikhsan Siregar,
R M Sari,
Khalida Syahputri,
I Rizkya
Publication year - 2021
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/1122/1/012057
Subject(s) - ant colony optimization algorithms , job shop scheduling , scheduling (production processes) , computer science , algorithm , ant , operations research , mathematical optimization , engineering , mathematics , embedded system , computer network , routing (electronic design automation)
Private company produces doors according to the customer orders (make to order) with various types of products. The company several times experiencing delay of delivery to consumers so that the main cause of the occur in the company caused by the length of the lead time. The length of the lead time occur due to the increasing varied quantity of consumer demand when the product processing step use the same machine. The company implements First Come First Served (FCFS) scheduling system but does not able to produce an appropriate scheduling. The value of the makespan with the FCFS method is 2579,40 hours with the sequence of door leaf job products 1-2-3-4-5-6 namely colonial 6P, Carolina 5P, Napoleon, GD-1L, SP-2P, and GD-D456. The company reschedules to minimize the makespan using the ant colony algorithm and compares the results of the scheduling with the FCFS method. The order of product process using the ant colony algorithm are jobs 1-6-4-3-5-2 followed by colonial 6P, GD-D456, GD-1L, Napoleon, SP-2P and Carolina 5P with lower makespan values of 2500 hours. The results of the actual method using FCFS and the proposed method using the ant colony algorithm comparison shows an efficiency value of 3,057%.