In this paper, we discuss the scheduling problem of lot production lines in the Toyota production system. A lot production line at Toyota produces parts in accordance with its schedule, which is planned in advance using lot sizes predetermined for each part. The lot size of each part produced in practice is the consumption of the part in the subsequent process in the time interval between the starting time of the previous production run of the part and the starting time of the next production run. As the schedule of lot production lines is determined in advance, in order to adapt to fluctuations in parts consumption, the lot size of the part is changed every time the part is produced. In scheduling lot production lines, the consumption of each part in the time interval between a certain production run of the part and the next production run need to be equal to the lot size predetermined for each part as much as possible. The reason is that we must hold the part inventory equal to the part consumption in the maximum time interval. Therefore, we need to develop a schedule to reduce the total amount of the inventory of each part to a minimum. We propose an approximation algorithm and a method for improving the feasible solution computed by the approximation algorithm. We show, by numerical examples, that the methods presented efficiently obtain a good solution.
View full abstract