Minimizing the total weighted waiting times and instability in a rescheduling problem with dynamic jobs weight

Abstract

Thanks to smart technological tools, customers can at any moment create or modify their commands. This reality forced many production firms to become sensitive in rescheduling pro-cesses. In the literature, most of rescheduling problems consider classical efficiency measures. How-ever, some existing works also consider stability as a measure for limiting the deviation from initial schedule. In this work, we aim to bridge the gap in existing works on rescheduling by investigating a new approach to measure simultaneously efficiency by the total weighted waiting times and stability by the total weighted completion time deviation. This combination of criteria is very signifi-cant in industrial and hospital environments. In this paper, a single machine rescheduling problem with jobs arriving over time is considered. A mixed integer linear programming (MILP) model is designed for this problem and an iterative predictive-reactive strategy for dealing with the online part. Numerical results show that, at each time the jobs are rescheduled, the low weight ones move forward. Consequently, a new concept consisting in increasing the jobs weight as function of time is established. The effect of this new conception is evaluated by the evolution of the maximum flow-time. Eventually, the computing time of the MILP resolution is studied to explore its limitations.