Work

A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance

Year: 2024

Type: article

Abstract: Inspired by a real-world maintenance/job scheduling issue coming from the semiconductor industry, the present paper proposes a new heuristic algorithm structure for the single machine scheduling T-problem with flexible and variable maintenance, job release dates and sequence dependence setup times. Considering the typical short-term production planning needs, a single maintenance problem has to be scheduled within a certain time interval, along with a set of jobs so as to minimize the total tardiness. A twofold contribution emerges from the present paper. First, four mixed-integer linear programming models are developed for the problem at hand and compared in terms of time to convergence and computational complexity. Second, a novel heuristic algorithm, which has been configured into three distinct variants, has been compared with 17 alternative heuristics from the relevant literature based on a comprehensive experimental campaign. The numerical results allow the selection of the most suitable MILP model and confirm the effectiveness of the proposed heuristic approach.

Source: Computers & Operations Research

DOI: 10.1016/j.cor.2024.106849

Authors: Antonio Costa, Roberto Rosario Corsini, Daniele Pagano, Victor Fernandez-Viagas

Institutions: University of Catania, STMicroelectronics (Italy), Universidad de Sevilla

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,470

Funder: Key Digital Technologies Joint Undertaking