LEFEBVRE, Henri; CLAUTIAUX, François; DETIENNE, Boris

doi:10.1007/s10951-022-00775-1

Métadonnées

Licence d’utilisation du document

LEFEBVRE, Henri
Alma Mater Studiorum Università di Bologna = University of Bologna [UNIBO]

CLAUTIAUX, François
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]

DETIENNE, Boris
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]

Langue

Article de revue

Ce document a été publié dans

Journal of Scheduling. 2023 n° 26, p. 169-191

Springer Verlag

Date de soutenance

2023

Résumé en anglais

Minimizing the weighted number of tardy jobs {on one machine} is a classical and intensively studied scheduling problem. In this paper, we develop a two-stage robust approach, where exact weights are known after accepting to perform the jobs, and before sequencing them on the machine. This assumption allows diverse recourse decisions to be taken in order to better adapt one's mid-term plan.The contribution of this paper is twofold: first, we introduce a new scheduling problem and model it as a min-max-min optimization problem with mixed-integer recourse by extending existing models proposed for the deterministic case. Second, we take advantage of the special structure of the problem to propose twosolution approaches based on results from the recent robust optimization literature: namely the finite adaptability (Bertsimas and Caramanis, 2010) and a convexification-based approach (Arslan and Detienne, 2022). We also study the additional cost of the solutions if the sequenceof jobs has to be decided before the uncertainty is revealed.Computational experiments are reported to analyze the effectiveness of our approaches.< Réduire

Mots clés en anglais

One-machine scheduling

Robust optimization

Two-stage optimization

Mixed-integer recourse

Exact approach

Integer programming

Métadonnées

Partager cette publication !

Licence d’utilisation du document

A two-stage robust approach for {minimizing} the weighted number of tardy jobs with objective uncertainty

Langue

Ce document a été publié dans

Date de soutenance

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche