Minimizing the Weighted Number of Tardy Jobs: Data-Driven Heuristic for Single-Machine Scheduling

TL;DR

This paper presents a novel data-driven heuristic for single-machine scheduling that combines machine learning with problem-specific features to effectively minimize the total weight of tardy jobs, outperforming existing methods.

Contribution

It introduces a new ML-based scheduling heuristic that ensures feasible solutions and demonstrates superior performance across diverse datasets compared to state-of-the-art approaches.

Findings

Significantly reduces optimality gap in scheduling

Achieves higher number of optimal solutions

Demonstrates robustness across varied data scenarios

Abstract

Existing research on single-machine scheduling is largely focused on exact algorithms, which perform well on typical instances but can significantly deteriorate on certain regions of the problem space. In contrast, data-driven approaches provide strong and scalable performance when tailored to the structure of specific datasets. Leveraging this idea, we focus on a single-machine scheduling problem where each job is defined by its weight, duration, due date, and deadline, aiming to minimize the total weight of tardy jobs. We introduce a novel data-driven scheduling heuristic that combines machine learning with problem-specific characteristics, ensuring feasible solutions, which is a common challenge for ML-based algorithms. Experimental results demonstrate that our approach significantly outperforms the state-of-the-art in terms of optimality gap, number of optimal solutions, and adaptability across varied data scenarios, highlighting its flexibility for practical applications. In addition, we conduct a systematic exploration of ML models, addressing a common gap in similar studies by offering a detailed model selection process and providing insights into why the chosen model is the best fit.