12 papers
Resource-Constrained Joint Replenishment via Power-of- Policies
Danny Segev
The continuous-time joint replenishment problem has long served as a foundational inventory management model. Even though its unconstrained setting has seen recent algorithmic adva…
Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
Danny Segev
The economic warehouse lot scheduling problem is a foundational inventory-theory model, capturing computational challenges in dynamically coordinating replenishment decisions for m…
Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
Danny Segev
In this focused technical paper, we present long-awaited algorithmic advances toward the efficient construction of near-optimal replenishment policies for a true inventory manageme…
Approximation Schemes for Sequential Hiring Problems
Danny Segev, Uri Stein
The main contribution of this paper resides in providing novel algorithmic advances and analytical insights for the sequential hiring problem, a recently introduced dynamic optimiz…
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…