Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem

Abstract

AbstractThis work addresses the unrelated parallel machine scheduling problem with sequence‐dependent setup times, in which a set of jobs must be scheduled for execution by one of the several available machines. Each job has a machine‐dependent processing time. Furthermore, given multiple jobs, there are additional setup times, which vary based on the sequence and machine employed. The objective is to minimize the schedule's completion time (makespan). The problem is NP‐hard and of significant practical relevance. The present paper investigates the performance of four different stochastic local search (SLS) methods designed for solving the particular scheduling problem: simulated annealing, iterated local search, late acceptance hill‐climbing, and step counting hill‐climbing. The analysis focuses on design questions, tuning effort, and optimization performance. Simple neighborhood structures are considered. All proposed SLS methods performed significantly better than two state‐of‐the‐art hybrid heuristics, especially for larger instances. Updated best‐known solutions were generated for 901 of the 1000 large benchmark instances considered, demonstrating that particular SLS methods are simple yet powerful alternatives to current approaches for addressing the problem. Implementations of the contributed algorithms have been made available to the research community.