Penjadwalan Produksi Dengan Algoritma Dannenbring dan Branch and Bound pada Produksi Atap Galvalum Di PT NS Bluescope Lysaght Indonesia

PT NS Bluescope Lysaght Indonesia has a problem with delay in completing the consumer’s order. Optimal scheduling is needed as a sequence of production processes, to reduce the risk of delaying ordered product completion. This study aims to get the best result with the smallest makespan’s value from the sequences using the Branch and Bound and Dannenbring methods. The method with the best result between the two methods will be applied at PT NS Bluescope Lysaght Indonesia. The process starts from data that has been processed with the uniformity test, data adequacy test, and performance rating to get the standard time as a basis. The standard time would be calculated using the Branch and Bound and Dannenbring methods. Based on the scheduling that has been done, the makespan using Branch and Bound method is smaller than the Dannenbring method that is 639,580 seconds from the 1-4-3-2 sequence. This method can decrease makespan up to 80.420 seconds or it has been reduced 11.169% from the initial condition. Thus, this method can be applied by PT NS Bluescope Lysaght Indonesia to arrange the production schedule of Krip-Lok galvalume, Trimdek Optima, Spandek, and Smartdek. It also can be applied to arrange the schedule for the other types of products to reduce the production time.