A Modified Branch and Bound Algorithm for Batch Scheduling in Discrete Manufacture System

Indrapriyatna, Ahmad Syafruddin and Triha, Hadigufri A Modified Branch and Bound Algorithm for Batch Scheduling in Discrete Manufacture System. In: APCOMS-IMEC 2017, 7 - 8 Dec 2017, Yogyakarta, Indonesia.

	Text (Cover dan isi prosiding) 012074 - Published Version Download (79kB)
Preview	Text (Cover dan isi prosiding internasional) Ahmad_Cover+paper+h_indeks.pdf - Published Version Download (1MB) | Preview

Abstract

Indrapriyatna et al. [1,2] have developed a batch scheduling model. In a model with a discrete batch size, three methods are used to convert batch size to integer. Based on numerical calculations it is found that there is no method that always result in the smallest total cost in every data set. This research is done to try other methods to convert batch size to integer. The approach done is by using the Branch and Bound Algorithm Modification that is adjusted to get scheduling for each batch without changing the number of batch (N) and the number of quantities (q) that are going to be produced. The result is the CSA_Dis_BB Algorithm that gets a discrete (integer) batch size. The implementationed of CSA_Dis_BB Algorithm is done on 7 sets of data from [1,2]. This algorithm does work to produce the smallest total cost.

Actions (login required)

View Item