Open shop rescheduling approache under unexpected arrival of a rush job

Aiming at the unexpected arrival of a rush job in an open shop, how to conduct the effective rescheduling was investigated. Specific rescheduling approaches after disruption were explored based on match-up scheduling strategy. To form four alternative rescheduling schemes, two rescheduling horizon determination methods oriented to split idle times-related or continuous idle times-related were proposed, and two problem-specific heuristics algorithm were designed in reduced scheduling stage. In simulation experiments, various rescheduling scenarios under rush job distraction were simulated, and the rescheduling performance indicators were set respectively from makespan, relative completion time of rush job and sequence similarity, thus the four proposed schemes were observed under the same scene independently. Experimental results indicated that the later the rush job arrives, the relatively better the proposed schemes perform. Furthermore, several applicable suggestions about the choice among schemes were obtained by statistical analysis of the observation results related to different rescheduling schemes.