• Home
• Conferences
• Current Member Societies
• EURO Working Groups
• Publications

EURO Bulletin Board - Webinars

Scheduling Seminar Series Upcoming talk: Kevin Schewior - Combinatorial Perpetual Scheduling, March 18, 2026 I 15:00-16:30 CET I Zoom & YouTube

• Objective of a virtual seminar on scheduling research and applications is to discuss both the field's newest advancements and survey traditional areas. Seminars take place typically on every second Wednesday through three different time zones (Europe, the Middle East & Africa, North America & South America, and Asia, Australia & Oceania).
  
  More information about the Scheduling Seminar can be found here: https://schedulingseminar.com/
  
  

  Upcoming Talk:

  
  18 March 15:00–16:30 CET

  Presenter: Kevin Schewior - Combinatorial Perpetual Scheduling

  
  Abstract:
  
  

  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.

  You can watch the talk online at: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A/live
  
  
  

  Zoom: https://cesnet.zoom.us/j/98113121925?pwd=WhXaUqchaTaS2xqMQhx7ea1YXgxW9u.1#success

  Meeting ID: 981 1312 1925

  Passcode: 559971

  
  ********
  We warmly invite the entire community to join our upcoming talks:
  *****************************************************
  
  
  

  1 April, 15:00–16:30 CET

  Presenter: Tonguç Ünlüyurt - A review of the sequential testing problem and its extensions

  Abstract:
  
  

  In the sequential testing problem, the goal is to evaluate a Boolean (or discrete) function with the minimum expected cost, where the values of the variables can be learned by paying a cost. The variables take values independent of each other with known probabilities. For a simple series system, a solution is a permutation of the variables, whereas in the general case, a solution can be described by a binary decision tree. The problem has been studied in different domains for various applications. In this talk, we will define various extensions of the problem and focus on works published in the last 20 years to provide a comprehensive review of the results obtained. We also provide insights to explore potential areas for future research

  You can watch the talk online at: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A/live

  ********
  
  

  15 April, 15:00–16:30 CET

  Presenter: Bruno Escoffier - Resource Leveling For Scheduling Problems: Some Complexity And Approximation Results

  Abstract:
  
  

  Scheduling problems usually consider resource constraints as hard constraints. In resource leveling instead, a function of resource use is optimized, typically under a deadline constraint. This is motivated by the fact that, in practice, additional resources (e.g., workforce or machines) can be mobilized in order to meet a deadline, yet at some cost. In this talk we will focus on the following setting: given a (target) resource level, our goal is to schedule the jobs in such a way as to best respect this resource level, that is to say, to exceed it as little as possible. We study classical scheduling problems (with or without precedence constraints, with arbitrary or unit processing times,...) in this setting, providing both positive and negative complexity and approximability results.

  
  You can watch the talk online at: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A/live

  
  *********
  
  

  10 June, 15:00–16:30 CET

  Presenter: Danny Segev - New Approximation Guarantees for The Inventory Staggering Problem

  Abstract:
  
  

  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.

  
  You can watch the talk online at: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A/live

  *************

  24 June, 15:00–16:30 CET
  
  

  Presenter: Florian Jaehn - Scheduling with restrictions on job positions

  
  

  Abstract:
  
  

  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.

  
  You can watch the talk online at: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A/live
  Posted on 2026-03-16 by Magdalena Sroczan