Just-in-time scheduling on identical parallel machines
In the mass production environment it is too costly to define and control due dates for individual items. Instead, the model proposed in Toyota is applied that assumes monitoring the actual production rate of particular products. The objective is to construct schedules with minimum deviation from an ideal product rate. We consider the so called Product Rate Variation model and scheduling algorithms developed to solve this problem with two types of objectives: to minimize the total or maximum deviation from the ideal production rate and we show that the algorithms can be generalized to solve the scheduling problem in case of identical parallel machines.