Work

Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

Year: 2024

Type: article

Abstract: We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.

Source: Optimization Letters

DOI: 10.1007/s11590-024-02138-5

Authors: Enrique Gerstl, Gur Mosheiov

Institution: Hebrew University of Jerusalem

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,990

Funders: Deutsche Forschungsgemeinschaft, Hebrew University of Jerusalem