Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances
| Result of project: | Cluster 4.0 – Methodology of System Integration |
| ID project: | EF16_026/0008432 |
| Authors: | Lukáš Hejl, Přemysl Šůcha, Antonín Novák, Zdeněk Hanzálek |
| Published in: | European Journal of Operational ResearchVolume 298, Issue 2, 16 April 2022, Pages 413-424 |
| Link: | https://www.sciencedirect.com/science/article/abs/pii/S037722172100597X |
| DOI: | https://doi.org/10.1016/j.ejor.2021.07.002 |
Abstract:
This paper addresses a single machine scheduling problem minimizing the weighted number of tardy jobs, where each job is characterized by processing time, due date, deadline, and weight. It is known from the existing literature that so-called strongly correlated instances, i.e., instances where each job has the weight equal to its processing time plus a constant, are significantly harder to solve compared to instances without this relation. In this work, we extend an exact algorithm proposed in Baptiste et al. (2010) with the aim of solving the strongly correlated instances significantly faster. The main improvement is the new integer linear programming model for strongly correlated instances utilizing a decomposition according to the number of tardy jobs. Other proposed improvements are tighter lower and upper bounds which can be applied to all types of instances. The best-known algorithm proposed in Baptiste et al. (2010) cannot solve all instances with 250 jobs to the optimum within an hour. On the same hardware, our relatively simple improvements implemented into the algorithm proposed by Baptiste et al. enable solving all examined strongly correlated instances to the optimum within an hour for up to 5,000 jobs and reduce the computational time on other instances as well.
This project has received funding from the Ministry of Education, Youth and Sports, program Operational Programme Research, Development and Education under agreement No. EF16_026/0008432.
