84 citations · 126 across the 21 of their papers we have counts for
4 papers · 1 filter
Approximation Algorithms for Fair Repetitive Scheduling
Danny Hermelin, Danny Segev, Dvir Shabtay
We consider a recently introduced fair repetitive scheduling problem involving a set of clients, each asking for their associated job to be daily scheduled on a single machine acro…
Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
Danny Segev, Gidi Steinberg
In this paper, we address open computational questions regarding the market share ranking problem, recently introduced by Derakhshan et al. (2022). Their modelling framework incorp…
Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
Danny Segev
While dynamic policies have historically formed the foundation of most influential papers dedicated to the joint replenishment problem, we are still facing profound gaps in our str…
New Approximation Guarantees for The Inventory Staggering Problem
Noga Alon, Danny Segev
Since its inception in the mid-60s, the inventory staggering problem has been explored and exploited in a wide range of application domains, such as production planning, stock cont…