Dear scheduling researcher,

We are delighted to announce the talk given by Christoph Dürr http://www.lip6.fr/Christoph.Durr (Sorbonne Uni).

The title is "Three models for scheduling under explorable uncertainty".

The seminar will take place on Zoom on Wednesday, December 8 at 14:00 UTC.

Join Zoom Meeting https://cesnet.zoom.us/j/94434410356?pwd=SWlmUElObjhtQWZCcm9PZGw5TTVnZz09 https://cesnet.zoom.us/j/94434410356?pwd=SWlmUElObjhtQWZCcm9PZGw5TTVnZz09

Meeting ID: 944 3441 0356 Passcode: 040955

You can follow the seminar online or offline on our Youtube channel as well:

https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.

We consider a single machine scheduling problem, where every job has a processing time and a priority weight and the objective is to minimize the total weighted sum of completion times. The novelty is that the job characteristics are initially given in an imprecise manner to the algorithm. Tests can be performed for chosen jobs to learn their precise values, allowing for a better ordering of the jobs in the schedule. These tests however take some time, delaying the subsequent schedule. The algorithm needs to produce a schedule consisting of executions of all jobs and tests of some jobs. We will present three different models that have been studied in this context, as well as the results obtained for each of them. The talk covers papers authored by Levi, Magnanti and Shaposhnik, by C.D., Thomas Erlebach, Nicole Megow, Julie Meißner, and by Fanny Dufossé, C.D., Noël Nadal, Denis Trystram and Óscar C. Vásquez.

The next talk in our series will be given by

Rubén Ruiz (UP de València)| December 22| State-of-the-art flowshop scheduling heuristics: Dos and Don'ts

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

With kind regards

Zdenek, Mike and Guohua