Integer Batch Scheduling Problems for a Single-Machine to Minimize Total Actual Flow Time
Yusriski R.a,b, Astuti B.a, Sukoyob, Samadhi T.M.A.A.b, Halim A.H.b
a Univesity of General Achmad Yani, Bandung, 40284, Indonesia
b Bandung Institute of Technology, Bandung, 40132, Indonesia
Abstract
© 2015 The AuthorsThis research addresses a batch scheduling model for a single-machine under a Just-In-Time (JIT) production system that produces discrete parts. The objective is to minimize the total actual flow time, defined as the time when parts are flowing on the shop floor from its arrival time to their common delivery time. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. The problem is solved based on the Lagrange Relaxation method. The optimality test of the proposed algorithm is done by comparing the result of the proposed algorithm with the Integer Composition method. The result of numerical experiments demonstrates that the proposed algorithm is very efficient to solve the problems.
Author keywords
Indexed keywords
a single-machine,batch scheduling,integer batch sizes,total actual flow time