Branch and Bound Method to Overcome Delay Delivery Order in Flow Shop Scheduling Problem

Abstract

Abstract Leather industry is one of the industrial sector in Indonesia. Leathercraft industry is one of the industrial sector which concerning to improve the national economic growth of Indonesia. PT Mandiri Jogja International (PT M. Joint) has a problem in late completion production time which caused delay delivery order. So that this company need an evaluation on job scheduling production system which have a smallest total completion production time (makespan). This research is to make a new sequencing scheduling using Branch and Bound method, which has the smallest total completion production time (makespan). Branch and bound is one of the algorithm used to make a new sequencing scheduling. The results showed that scheduling with the actual method applied in the company by sequencing 4-3-5-1-2 has makespan score 13630.68 seconds or 3.79 hours. The scheduling using Branch and Bound method by sequencing 2-1-3-4-5 and 2-1-4-3-5 have a makespan score 12954.46 seconds or 3.60 hours. Branch and Bound method has a makespan 0.19 hours small than actually method at the company. Therefore, branch and bound method is used to make a new sequencing scheduling to overcome delay delivery order at PT M. Joint Exclusive Leathercraft.