activity
20172021
most citedDominance inequalities for scheduling around an unrestrictive common due date

7 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2021

Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem

Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux +1

In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight subset of…

cs.DM2021★ 7 cited

Dominance inequalities for scheduling around an unrestrictive common due date

Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum

The problem considered in this work consists in scheduling a set of tasks on a single machine, around an unrestrictive common due date to minimize the weighted sum of earliness and…

cs.DS2019★ 6 cited

Mixed integer formulations using natural variables for single machine scheduling around a common due date

Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum

While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we propose in this work mixed integer formulations.…

math.OC2017

Orbitopal fixing for the full (sub)-orbitope and application to the Unit Commitment Problem

Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner

This paper focuses on integer linear programs where solutions are binary matrices, and the corresponding symmetry group is the set of all column permutations. Orbitopal fixing, as…

cs.NI2017★ 2 cited

Securing Virtual Network Function Placement with High Availability Guarantees

Marco Casazza, Pierre Fouilhoux, Mathieu Bouet +1

Virtual Network Functions as a Service (VNFaaS) is currently under attentive study by telecommunications and cloud stakeholders as a promising business and technical direction cons…