Insertion of new idle time for unrelated parallel machine scheduling with job splitting and machine breakdowns

In real production systems, there are some uncertainties such as failure uncertainty and uncertain processing time. This paper addresses predictable scheduling and rescheduling, considering machine breakdown and eligibility in the unrelated parallel machines environment with job splitting including textile industry and printed circuit board (PCB) manufacturing. We propose a new approach to achieving robust and stable schedule to minimize expected maximum completion time and expected total deviation between the jobs' planned start times and actual start times simultaneously. In the first step of the approach, we present a predictable scheduling algorithm using the insertion of new idle time considering job splitting. In the next step, we present a schedule repair rule considering job splitting for rescheduling. The computational experiments show that the proposed algorithm outperforms alternative algorithms.