Unrelated Parallel Machine Scheduling Under Machine Availability and Eligibility Constraints To Minimize the Makespan of Non-Resumable Jobs

Abstract

This study considers the scheduling problem of multiple independent and non-resumable jobs on unrelated parallel machines subject to machine availability and eligibility constraints. For each machine, there is a maximum continuous working time due to an unavailable period required for maintenance or tool changeover so that multiple unavailable periods on each machine may occur. The start time of an unavailable period on each machine is flexible and depends on the sum of the processing times of all jobs completed before this unavailability period. The objective is to minimize the makespan, which is the time to complete the processing of all non-resumable jobs. We develop a mixed integer linear programming (MILP) model to solve the problem optimally and a heuristic algorithm to solve the problem instances for which the MILP model cannot achieve an optimal solution in a reasonable allowed solution time. Computational experiments are done to evaluate our solution approaches' performance in terms of quality and time. The results show that using a mixed integer linear programming model is not a practical alternative, especially for large -sized problem instances. However, the proposed heuristic algorithm finds near -optimal solutions in a very short time.