Answers are grounded in this paper and cite their sources.
The parallel machine rescheduling problem (PMRP) assumes that the jobs have different ready times and due date-to-deadline windows. PMRP can be defined as updating the existing schedule after being disrupted by job-related events including the arrival of new jobs, departure of an existing job, and changes to job priority. In PMRP, bi-criteria objective function is considered to simultaneously minimise both the total weighted tardiness (schedule quality) and schedule instability. We first formulate the PMRP by revising and extending the mixed integer linear programming (MILP) model of the scheduling problem in Kaplan and Rabadi (2012). Five heuristic algorithms, namely MetaRE, BestINSERT, SEPRE, LSHIFT and SHUFFLE, are introduced to handle the bi-objective PMRP using the developed algorithms by Kaplan and Rabadi (2012, 2013). Experiments have been conducted for small size (12 jobs) and large size (60 size) problems for different types of disruptions.
No takes yet. Share an insight, caveat, or question.
Kaplan et al. (2015) studied this question.
Synapse has enriched 7 related papers. Consider them for comparative context: