A discrete time reactive scheduling model for new order insertion in job shop, make-to-order industries

Overview & Synopsis

This research presents a new reactive scheduling methodology for job shop, make-to-order industries. An integer linear programming formulation previously developed by the authors to schedule this type of industries is extended to address the problem of inserting new orders in a predetermined schedule, which is important in order-driven industries. A reactive scheduling algorithm is introduced to iteratively update the schedules. Numerical results on realistic examples of job shops of different sizes illustrate the effectiveness of the approach. In each case, different alternatives for inserting a set of new orders in an initial schedule are optimally generated, enabling the user to choose the most convenient one. Solutions are characterized by measures of scheduling efficiency as well as stability measures that assess the impact of rescheduling operations in a previously defined scheduling solution.