Scheduling seminar

Download

schedulingseminar@rtime.felk.cvut.cz

June 2026

1 participants
2 discussions

Florian Jaehn (Helmut Schmidt University) | June 24 | Scheduling with restrictions on job positions.
by Zdenek Hanzalek 23 Jun '26

23 Jun '26

Dear scheduling researcher, We are delighted to announce the talk given Florian Jaehn (Helmut Schmidt University). The title is "Scheduling with restrictions on job positions". The seminar will take place on Zoom on Wednesday, June 24 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/99151541981?pwd=J8eTa7muqy4YK0i9sUgB3o7HPeMJdL.1 Meeting ID: 991 5154 1981 Passcode: 279493 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Unlike time restrictions on jobs, such as release dates or deadlines, which are common in scheduling, we consider position restrictions. For example, a job may be required to be in position x of the job sequence. Such a restriction may be motivated by maintenance scheduling, among other things. In maintenance scheduling, we may also encounter constraints, such as a maintenance operation that must be performed after executing at most k jobs. We provide an overview of classical one-machine problems and demonstrate how these additional constraints affect their complexity. While the complexity remains unchanged for many cases, it changes for some, revealing surprising effects. The next talk in our series will be in September. For more details, please visit 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/

1 0

Danny Segev (Tel Aviv University) | June 10 | New Approximation Guarantees for The Inventory Staggering Problem
by Zdenek Hanzalek 08 Jun '26

08 Jun '26

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/

1 0