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

June 2023

  • 1 participants
  • 2 discussions
Tami Tamir (Reichman Uni) | June 21 | Scheduling with Machine-Dependent Priority Lists
by Zdeněk Hanzálek 19 Jun '23

19 Jun '23
Dear scheduling researcher, We are delighted to announce the talk given by Tami Tamir (Reichman Uni). The title is "Scheduling with Machine-Dependent Priority Lists". The seminar will take place on Zoom on Wednesday, June 21 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/93107274739?pwd=ZzI0Y0RGYmtvaXhwdG5JZDQ4dDJQUT09 Meeting ID: 931 0727 4739 Passcode: 666002 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 natural, yet challenging variant of the parallel machine scheduling problem in which each machine imposes a preferential order over the jobs and schedules the jobs accordingly once assigned to it. We study the setting in which a centralized authority assigns the jobs to machines, as well as the associated non-cooperative game in which jobs are controlled by selfish agents who independently choose which machine to use. In the talk, I will define the model, highlight the differences from other well-analyzed job-scheduling optimization problems and coordinated mechanisms, and present some of our results for several natural objectives (e.g., Makespan, lateness, total completion-time minimization) As we show, having machine-dependent priority lists dramatically affects both the computational complexity of the problem and the equilibrium inefficiency. Joint work with Vipin Ravindran Vijayalakshmi and Marc Schroder. The next talk in our series will in September. 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
Vikram Tiwari (Vanderbilt Uni) | June 7 | Surgery Scheduling: Research and Practice
by Zdeněk Hanzálek 05 Jun '23

05 Jun '23
Dear scheduling researcher, We are delighted to announce the talk given by Vikram Tiwari (Vanderbilt University). The title is "Surgery Scheduling: Research and Practice". The seminar will take place on Zoom on Wednesday, June 7 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/96890046173?pwd=bjYzLzkzSUJMU1ZCMWhka2h4RjRqdz09 Meeting ID: 968 9004 6173 Passcode: 999261 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Scheduling of surgeries is a complex process that involves simultaneous scheduling of not only several resources (staff, room, equipment, supplies, instruments), but also building flexibility in capacity-reservation policies to accommodate most types of patient classes. In the case of trauma centers this complexity increases even more due to the need for dynamic rescheduling of elective surgeries as emergency surgeries arrive randomly. In practice, these issues are tackled every day in a ‘non-optimal / heuristic’ way. Recent research in this area has shown the potential of implementing modified priority rules. In contrast to trauma centers, ambulatory surgery centers only perform elective surgeries and have a lower cost structure. Their profitability is therefore dependent upon efficient use of capacity. Recent research has modeled these as Hybrid Flow Shops and solved the capacity planning problem using easy to implement heuristics. This talk will also discuss some new avenues of operating room scheduling that have not yet been researched by academics. The next talk in our series will be: Tami Tamir (Reichman Uni) | June 21 | Scheduling with Machine-Dependent Priority Lists. 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.