Integrated Scheduling of Tasks and Preventive Maintenance Periods in a Parallel Machine Environment With Single Robot Server

Abstract

In this study, the objective of minimizing makespan has been considered for a scheduling problem of identical parallel machines with a single server and unavailability constraints. The unavailability constraints correspond to preventive maintenance periods. In this study, the jobs and the maintenance periods are scheduled simultaneously. This scheduling problem has a wide range of potential application areas in the manufacturing environment. In addition, the studied problem is a challenging one from theoretical point of view, due to its NP-Hardness. To conduct the study, a lower bound (LB) for the problem, and three metaheuristics namely Simulated Annealing (SA), Tabu Search (TS), and Genetic Algorithm (GA) have been proposed. The best parameters settings of the proposed algorithms were conducted using pilot runs with a Taguchi design. The algorithms performance has been assessed by using a set of test problems generated randomly. These test problems are based on a literature benchmark. The size of the instances, or number of jobs, were up to 500. Along with the performance analysis of the proposed algorithms, the effect of varying processing times and unavailability periods on the performance of the proposed algorithms is studied. The present work provides strong evidence of the efficiency and the performance of the proposed algorithms.