An adaptive local search for large-scale parallel machine scheduling in textile production with release dates and sequence-dependent setup times

Abstract

This study proposes an adaptive local search heuristic to solve a real-world large-scale parallel machine scheduling problem with release dates and setup times, aiming to minimize total tardiness. The complexity of the problem stems from the need to synchronize machine availability, job release dates, and setup durations, which are crucial for meeting production deadlines and ensuring operational efficiency. Traditional optimization approaches often struggle to deliver timely solutions for large-scale industrial applications. Our heuristic method effectively explores the search space to identify schedules that significantly reduce total tardiness while adhering to the constraints of the production system. The approach was tested using real production data, and the results indicate that the heuristic consistently generated high-quality solutions within short computational times. The approach proved viable and efficient, offering a practical tool for improving scheduling performance and minimizing total tardiness in industries with similar operational constraints.