[Scheduling seminar] Danny Segev (Tel Aviv University) | June 10 | New Approximation Guarantees for The Inventory Staggering Problem

Dear scheduling researcher,

We are delighted to announce the talk given Danny Segev (Tel Aviv 
University). The title is "New Approximation Guarantees for The 
Inventory Staggering Problem". The seminar will take place on Zoom on 
Wednesday, June 10 at 13:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/99209667011?pwd=ICWK51KjbRMCN0VQ9eJrabmRfbXN8u.1

Meeting ID: 992 0966 7011
Passcode: 061504

You can follow the seminar online or offline on our Youtube channel as 
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A 
<https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A>

The abstract follows.
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 control systems, warehousing, and 
aerospace/defense logistics. However, even with a rich history of 
academic focus, we are still very much in the dark when it comes to 
cornerstone computational questions around inventory staggering and to 
related structural characterizations, with our methodological toolbox 
being severely under-stocked. The central contribution of this paper 
consists in devising a host of algorithmic techniques and analytical 
ideas — some being entirely novel and some leveraging well-studied 
concepts in combinatorics and number theory — for surpassing essentially 
all known approximation guarantees for the inventory staggering problem. 
In particular, our work demonstrates that numerous structural properties 
open the door for designing polynomial-time approximation schemes; these 
findings offer substantial improvements over currently available 
constant-factor approximations and resolve outstanding open questions in 
their respective contexts (Teo et al., 1998; Hum et al., 2005; Hochbaum 
and Rao, 2019, 2020). In parallel, we develop new theory around a number 
of yet-uncharted questions, related to the sampling complexity of peak 
inventory estimation as well as to the plausibility of groupwise 
synchronization.

The next talk in our series will be:

Florian Jaehn (Helmut Schmidt University) | June 24 | Scheduling with 
restrictions on job positions.

For more details, please visit https://schedulingseminar.com/ 
<https://schedulingseminar.com/>

With kind regards

Zdenek Hanzalek, Michael Pinedo and Guohua Wan


-- 
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/

**********************************************************
*
*   Contributions to be spread via DMANET are submitted to
*
*                   [email protected]
*
*   Replies to a  message carried  on DMANET should NOT be
*   addressed to DMANET  but to  the original sender.  The
*   original  sender,  however,  is invited  to prepare an
*   update  of the replies  received and to communicate it
*   via DMANET.
*
*    DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
*      http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************