We are delighted to announce the talk given by Kevin Schewior
(University of Cologne). The title is "Combinatorial Perpetual
Scheduling". The seminar will take place on Zoom on Wednesday, March 18
at 14:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/94879279269?pwd=f21ZmDYYXpaIa8wH1tq9mTuHGTkSTU.1
Meeting ID: 948 7927 9269
Passcode: 632094
You can follow the seminar online or offline on our Youtube channel as
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A
The abstract follows.
In this talk, I am going to give an overview of recent developments in
perpetual scheduling, with a focus on combinatorial versions. Here,
given a set system I on a ground set E, a (perpetual) schedule consists
of an independent set from I for every discrete time step, with the
objective of fulfilling frequency requirements on the occurrence of
elements in E. We focus specifically on combinatorial bamboo garden
trimming, where elements accumulate height at growth rates g(e) for
element e and are reset to zero when scheduled, with the goal of
minimizing the maximum height attained by any element. As a
normalization, we assume that the vector of growth rates is given as a
convex combination of incidence vectors from I. We prove that, when the
set system is a matroid, it is possible to guarantee a maximum height of
at most 2, which is optimal. For general set systems, one can only
guarantee a height that is logarithmic in the cardinality of E. The talk
is partially based on joint work with Mirabel Mendoza-Cadena, Arturo
Merino, and Mads Anker Nielsen.
The next talk in our series will be Tonguc Unluyurt (Sabanci University)
| April 1 | A review of the sequential testing problem and its extensions.
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/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* 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/
*
**********************************************************
Posts
