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.
Highlights
Scheduling is essential to produce the order with exact allocations of resources, like the machines used, number of working operators, sequencing the work on parts, and the materials needed. [7] defines scheduling as the process of allocating resources over certain time frame in order to finish certain tasks
Optimal tests are only made on combinations that give the smallest total cost to the previous batch size
We have proposed a modified Branch and Bound algorithm, named The CSA_Dis_BB, to obtain an integer batch size
Summary
Scheduling is essential to produce the order with exact allocations of resources, like the machines used, number of working operators, sequencing the work on parts, and the materials needed. [7] defines scheduling as the process of allocating resources over certain time frame in order to finish certain tasks. Scheduling is essential to produce the order with exact allocations of resources, like the machines used, number of working operators, sequencing the work on parts, and the materials needed. [7] defines scheduling as the process of allocating resources over certain time frame in order to finish certain tasks. Problems of scheduling comes up whenever the work need to be done exceeds the resources. [3,4,5,6] discuss the problem of sequencing and deciding on the batch size which means the job size. Processing time is a variable of decision. The problem of this is how to decide on the batch size (batching) and the sequencing of the processes on those batches; this is called the batch sequencing. The problem of this is how to decide on the batch size (batching) and the sequencing of the processes on those batches; this is called the batch sequencing. [5] have proposed a batch scheduling model that take into account the storage costs and quality costs in a single machine production system
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
