list.iid.ciirc.cvut.cz
Sign In Sign Up
Manage this list Sign In Sign Up

Keyboard Shortcuts

Thread View

  • j: Next unread message
  • k: Previous unread message
  • j a: Jump to all threads
  • j l: Jump to MailingList overview

Scheduling seminar

Thread Start a new thread
Download
Threads by month
  • ----- 2025 -----
  • May
  • April
  • March
  • February
  • January
  • ----- 2024 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2023 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2022 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2021 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
schedulingseminar@rtime.felk.cvut.cz

May 2021

  • 1 participants
  • 2 discussions
Erik Demeulemeester (KU Leuven) | May 26 | On the State of the Art in Proactive/Reactive Project Scheduling
by Zdeněk Hanzálek 24 May '21

24 May '21
Dear scheduling researcher, We are delighted to announce the talk given by Erik Demeulemeester (KU Leuven). The title is "On the State of the Art in Proactive/Reactive Project Scheduling". The seminar will take place on Zoom on Wednesday, May 26 at 13:00 UTC. https://cesnet.zoom.us/j/93810859740?pwd=T3Z6d3hZSDM2UnFDRVQrMi9YMnY5Zz09 Meeting ID: 938 1085 9740 Passcode: 021060 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. The majority of publications in the extensive literature on resource-constrained project scheduling focus on a static deterministic setting for which a so-called baseline schedule is computed prior to project execution. In the real world, however, a project may be subject to considerable uncertainty. During the actual execution of a project, the baseline schedule may indeed suffer from disruptive events, causing the actually realized activity start times to deviate from the predicted baseline start times. This presentation focuses on robust project scheduling, in particular the development of effective and efficient proactive and reactive scheduling procedures. Proactive scheduling aims at generating robust baseline schedules that carry sufficient protection against possible schedule disruptions that may occur during project execution. Reactive scheduling procedures aim at repairing the baseline schedule when the built-in protection fails during the execution of the project. We discuss the fundamentals of state of the art proactive/reactive project scheduling approaches and discuss key directions for future research. The next seminar in our series will be given by Jinjiang Yuan (Zhengzhou Univ.) "Updated complexity results in single-machine primary-secondary scheduling for minimizing two regular criteria" and it will be held on June 9 at 13:00 UTC. For more details please visit https://schedulingseminar.com/ With kind regards Zdenek, Mike and Guohua -- 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
0 0
Martin Skutella (TU Berlin) | May 12 | Efficient Algorithms and Provably Good Solutions for NP-hard Scheduling Problems
by Zdeněk Hanzálek 07 May '21

07 May '21
Dear scheduling researcher, We are delighted to announce the talk given by Martin Skutella (TU Berlin). The title is "Efficient Algorithms and Provably Good Solutions for NP-hard Scheduling Problems". The seminar will take place on Zoom on Wednesday, May 12 at 13:00 UTC: https://cesnet.zoom.us/j/97275617228?pwd=R3ZEMlhialpFSlBUcUo2NEVmS214dz09 <https://cesnet.zoom.us/j/97275617228?pwd=R3ZEMlhialpFSlBUcUo2NEVmS214dz09> Meeting ID: 972 7561 7228 Passcode: 672344 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Machine scheduling problems are among the first optimization problems for which approximation algorithms have been analyzed. An approximation algorithm is a polynomial-time algorithm which always finds a feasible solution whose objective function value is within an a priori known factor (performance ratio) of the optimum solution value. In this talk we focus on identical parallel machine scheduling with total weighted completion time objective. We present, among other things, a refined analysis of the performance ratio for the weighted shortest processing time first (WSPT) rule. This is joint work with Sven Jäger. The next seminar in our series will be given by Erik Demeulemeester (FEB-KBI, KU Leuven) "On the State of the Art in Proactive/Reactive Project Scheduling" and it will be held on May 26 at 13:00 UTC. For more details please visit https://schedulingseminar.com/ With kind regards Zdenek, Mike and Guohua
1 0
0 0

HyperKitty Powered by HyperKitty version 1.3.12.