A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighted Tardiness

Abstract

Abstract A problem of minimizing the total weighted tardiness in the preemptive single machine scheduling for discrete manufacturing is considered. A hyper-heuristic is presented, which is composed of 24 various heuristics, to find an approximately optimal schedule whenever finding the exact solution is practically intractable. The three heuristics are based on the well-known rules, whereas the 21 heuristics are introduced first. Therefore, the hyper-heuristic selects the best heuristic schedule among 24 schedule versions, whose total weighted tardiness is minimal. Each of the 24 heuristics can solely produce a schedule which is the best one for a given scheduling problem. Despite the percentage of zero gap instances decreases as the greater number of jobs is scheduled, the average and maximal gaps decrease as well. In particular, the percentage is not less than 80 % when up to 10 jobs are scheduled. The average gap calculated over nonzero gaps does not exceed 4 % in the case of scheduling 7 jobs. When manufacturing consists of hundreds of jobs, the hyper-heuristic is made an online scheduling algorithm by applying it only to a starting part of the manufacturing process.