7 citations · 7 across the 1 of their papers we have counts for
3 papers
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…
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Marc Etheve, Zacharie Alès, Côme Bissuel +2
Mixed integer linear programs are commonly solved by Branch and Bound algorithms. A key factor of the efficiency of the most successful commercial solvers is their fine-tuned heuri…
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.…