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

March 2022

  • 1 participants
  • 2 discussions
Christian Artigues (LAAS - CNRS) | March 30 | Mixed integer linear programming for resource-constrained scheduling
by Zdeněk Hanzálek 28 Mar '22

28 Mar '22
Dear scheduling researcher, We are delighted to announce the talk given by Christian Artigues (LAAS - CNRS). The title is "Mixed integer linear programming for resource-constrained scheduling". The seminar will take place on Zoom on Wednesday, March 30 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/91490324777?pwd=dFV0UjRlL2UyZUg1ZC9ZdGtJb2FqUT09 Meeting ID: 914 9032 4777 Passcode: 848529 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Mixed-Integer linear programming (MILP) is one of the generic modeling and algorithmic solution framework for NP-hard scheduling problems, along with Constraint Programming (CP) and SAT solvers. However, the literature often reports poor results of MILP solvers for resource-constrained scheduling problems compared to CP or SAT-based approaches such as Lazy Clause Generation. However, even if this is partly true because of the powerful dedicated scheduling algorithms embedded in constraint propagators, MILP approaches can reach very good results in terms of primal and dual bounds if the right formulation and specialized MILP components such as valid inequalities and column generation are chosen for the problem at hand. This talk first reviews the standard MILP formulations for resource-constrained scheduling problems and a few recent advances in the field. In particular, we focus on basic polyhedral results, on the relative relaxation strength of compact and extended formulations augmented with valid inequalities. Finally, we provide examples, including industrial ones where MILP, possibly integrated in hybrid CP/SAT/MILP methods, appears as a technique of choice. The next talk in our series will be given by: Pascal Van Hentenryck (Georgia Tech) | April 13 | Constraint Programming for 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
Lars Mönch (Uni of Hagen) | March 16 | Scheduling Problems in Semiconductor Wafer Fabrication Facilities: Part 2
by Zdeněk Hanzálek 14 Mar '22

14 Mar '22
Dear scheduling researcher, We are delighted to announce the talk given by Lars Mönch (Uni of Hagen). The title is "Scheduling Problems in Semiconductor Wafer Fabrication Facilities: Part 2". The seminar will take place on Zoom on Wednesday, March 16 at 14:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/94701637415?pwd=TWI4ZDVINUNRd3pjWktQNjFDRXJJZz09 Meeting ID: 947 0163 7415 Passcode: 919535 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Semiconductors enable the systems and products that we use to work, communicate, travel, entertain, harness the energy, treat illness, make new scientific discoveries, and more. Semiconductor manufacturing is among the most complex manufacturing systems in existence today. This complexity makes scheduling semiconductor manufacturing systems extremely difficult. In this two-part seminar, we discuss scheduling problems in this challenging domain. In the second part, we discuss batch scheduling problems, multiple orders per job scheduling problems, and scheduling problems that include time lags for the jobs. Moreover, scheduling problems related to cluster tools will be also briefly considered. Solution techniques, mainly based on problem decomposition and metaheuristics, will be also discussed. Finally, future research direction for scheduling semiconductor wafer fabrication facilities will be identified. The next talk in our series will be given by: Christian Artigues (LAAS - CNRS) | March 30 | Mixed integer linear programming for resource-constrained 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.