Hamzadayi, AlperYildiz, Gokalp2025-05-102025-05-1020161569-190X1878-146210.1016/j.simpat.2016.02.0102-s2.0-84960345307https://doi.org/10.1016/j.simpat.2016.02.010https://hdl.handle.net/20.500.14720/15313In 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. (C) 2016 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/closedAccessDynamic SchedulingM Identical Parallel Machines Scheduling With A Common ServerSimulationSimulated AnnealingDispatching RulesSequence Dependent Setup TimesArticle63Q1Q1104132WOS:000373527400006