Hybrid strategy based complete rescheduling approaches for dynamic m identical parallel machines scheduling problem with a common server

• Dynamic m identical parallel machines scheduling problem is addressed.
• Sequence dependent setup operations are performed by a single server.
• Complete rescheduling approaches are proposed and adapted into the simulation model.
• A hybrid rescheduling strategy is used to control the dynamic system.
• A priority based performance measure is proposed.

In this paper, a simulated annealing and seven dispatching rule based complete rescheduling approaches are proposed for the dynamic m identical parallel machines scheduling problem with a common server to generate new schedules depending on the hybrid rescheduling policy. A priority based performance measure is proposed to minimize the number of tardy jobs as primary goal and the square root of the mean-squared deviation for due dates as secondary goal. The proposed complete rescheduling approaches are executed in a hypothetical simulation case to minimize the proposed performance measures under different scheduling frequencies and due date tightness factors. The rankings of the proposed approaches are compared by using simple additive weighting method under different weighting scenarios. The utility results indicate that simulated annealing based complete rescheduling method produces better scheduling performance when compared to dispatching rule based complete rescheduling methods in general.