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 2022

  • 1 participants
  • 2 discussions
Stanislaw Gawiejnowicz (AMU Poznañ) | May 25 | Past, present and future of time-dependent scheduling
by Zdeněk Hanzálek 23 May '22

23 May '22
Dear scheduling researcher, We are delighted to announce the talk given by Stanislaw Gawiejnowicz (AMU Poznañ). The title is "Past, present and future of time-dependent scheduling". The seminar will take place on Zoom on Wednesday, May 25 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/91521949771?pwd=a091cWhwY1RzUGdYck9QeFd3d29vQT09 Meeting ID: 915 2194 9771 Passcode: 759526 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. In the lecture, we will present a general landscape of time-dependent scheduling which is one of the main research domains in modern scheduling theory. This lecture will be divided into three parts. In the first part, we will sketch the main dates in time-dependent scheduling development, specify the most important forms of time-dependent processing times and formulate the basic assumptions of time-dependent scheduling. Next, we will present the main results from that area, paying a special attention to applied proof techniques and mutual relations between different time-dependent scheduling problems. Finally, we will discuss selected open problems in time-dependent scheduling, summarizing known results for each open problem and indicating possible ways of its further research. The next talk in our series will be given by: Nicole Megow (Universität Bremen) | June 8 | Scheduling under Uncertainty 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
Patrick De Causmaecker (KU Leuven) | May 11 | Data Science Meets Scheduling
by Zdeněk Hanzálek 09 May '22

09 May '22
Dear scheduling researcher, We are delighted to announce the talk given by Patrick De Causmaecker (KU Leuven). The title is "Data Science Meets Scheduling". The seminar will take place on Zoom on Wednesday, May 11 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/99017304143?pwd=N2VaLzlWT2FWTlFaamNQWkV1N2UrZz09 Meeting ID: 990 1730 4143 Passcode: 922592 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. The impact of techniques from data science and machine learning on scheduling is investigated. We review a number of recently emerged applications of these techniques that can shed a new light on combinatorial optimization in general. We give concrete examples for scheduling in particular. We distinguish on-line techniques, that is, data science techniques integrated into advanced algorithms, off-line techniques which can be used to improve, select of construct algorithms as well as techniques that consider the problem as living in a space of which the dimensions are set by specific properties of its instances. We give examples of recent results obtained for specific problems in the scheduling domain. Meeting works in two directions. We give an example where a recent theoretical result for a combinatorial optimization problem provides new insights in the structures on which the data science techniques can operate. In this case, the theoretical result allowed to locate a region of hard problem instances in the instance space. The next talk in our series will be given by: Stanislaw Gawiejnowicz (AMU Poznañ) | May 25 | Past, present and future of time-dependent scheduling 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

HyperKitty Powered by HyperKitty version 1.3.12.