Author:
Wira Ranata I Gede,Damayanti Dida Diah,Astuti Murni Dwi
Abstract
Abstract
In recent years the development of manufacture in Indonesia has increase rapidly. Many companies must improve their performance to meet the requirement of the customer needs. Scheduling is an important phase in production. One kind of the problem is scheduling in parallel machine. Total jobs will be processed in the paper are 249 and it divided into 3 types of machine. Every job has their due dates and the problem is some jobs exceed the due dates and make tardiness in some jobs. The total tardiness in the existing scheduling are 8134 hours. This paper set a proposed approach using genetic algorithm to minimization total tardiness in real case factory with a parallel machine type scheduling. The proposed method compared with dispatching heuristic rule EDD and the existing scheduling of the factory. The proposed approach results demonstrate that a genetic algorithm give a better scheduling solution then the EDD rule and the existing schedule. Proposed scheduling using GA can reduce the tardiness becomes 723,97 hours or 91,10% from the existing schedule.
Reference22 articles.
1. A Genetic Algorithm To Minimize Makespan and Number of Tardy Jobs In Parallel Machine Scheduling Problems;Çİçeklİ;Bilişim Teknol Derg.,2016
2. Parallel Machine Scheduling Problems: A Survey;Mokotof;Asia-Pasific J Oper Res.,2001
3. Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs;Drobouchevitch;Comput Oper Res [Internet].,2012