z-logo
open-access-imgOpen Access
Production scheduling using ant colony optimization in furniture industry
Author(s) -
Ukurta Tarigan,
Ikhsan Siregar,
Khairil Juhdi Siregar,
Ukurta Tarigan
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/012056
Subject(s) - ant colony optimization algorithms , job shop scheduling , scheduling (production processes) , computer science , lead time , operations research , ant colony , industrial engineering , manufacturing engineering , operations management , engineering , algorithm , routing (electronic design automation) , embedded system
Every association tries to always create an effective and efficient production process. High competition in the industrial world during this time has led to industrial growth which has influence to a company to increase overall productivity in their production activities. For a production activity, in order to obtain an optimum result, all production activities must first be planned properly. Production scheduling is very important in the production process of a product in the company. The first come first served scheduling system currently implemented by the company capable to produce an appropriate scheduling. This causes the high total lead time (makespan) resulted and makespan obtained does not meet the due date. Therefore, it is necessary for rescheduling in order to decrease the overall total lead time to meet customer orders. The study design uses the ant colony algorithm to design the scheduling of door leaf production. The result shows that production scheduling using the ant colony algorithm resulted in scheduling sequences based on the length of lead time are job 1-job 6-job 4-job 3-job 5-job 2. The ant colony method is able to decrease slightly the total lead time product of 3,06%.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here