Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances

Autor: Lukáš Hejl, Antonin Novak, Přemysl Šůcha, Zdeněk Hanzálek
Rok vydání: 2022
Předmět:
Zdroj: European Journal of Operational Research. 298:413-424
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2021.07.002
Popis: 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.
Databáze: OpenAIRE
Externí odkaz: