Afficher la notice abrégée

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

hal.structure.identifierAlma Mater Studiorum Università di Bologna = University of Bologna [UNIBO]
dc.contributor.authorLEFEBVRE, Henri
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierFormulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
dc.contributor.authorCLAUTIAUX, François
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierFormulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
dc.contributor.authorDETIENNE, Boris
dc.date2023
dc.date.accessioned2024-04-04T02:37:00Z
dc.date.available2024-04-04T02:37:00Z
dc.date.issued2023
dc.identifier.issn1094-6136
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190770
dc.description.abstractEnMinimizing 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.
dc.language.isoen
dc.publisherSpringer Verlag
dc.subject.enOne-machine scheduling
dc.subject.enRobust optimization
dc.subject.enTwo-stage optimization
dc.subject.enMixed-integer recourse
dc.subject.enExact approach
dc.subject.enInteger programming
dc.title.enA two-stage robust approach for {minimizing} the weighted number of tardy jobs with objective uncertainty
dc.typeArticle de revue
dc.identifier.doi10.1007/s10951-022-00775-1
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
dc.subject.halMathématiques [math]/Optimisation et contrôle [math.OC]
bordeaux.journalJournal of Scheduling
bordeaux.page169-191
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.issue26
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-02905849
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-02905849v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal%20of%20Scheduling&rft.date=2023&rft.issue=26&rft.spage=169-191&rft.epage=169-191&rft.eissn=1094-6136&rft.issn=1094-6136&rft.au=LEFEBVRE,%20Henri&CLAUTIAUX,%20Fran%C3%A7ois&DETIENNE,%20Boris&rft.genre=article


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée