Scheduling seminar

Download

schedulingseminar@rtime.felk.cvut.cz

May 2026

1 participants
2 discussions

Jin QI (Hong Kong UST) | May 27 | Elective Surgery Sequencing and Scheduling Under Uncertainty
by Zdenek Hanzalek 25 May '26

25 May '26

Dear scheduling researcher, We are delighted to announce the talk given by Jin QI (Hong Kong UST). The title is "Elective Surgery Sequencing and Scheduling Under Uncertainty". The seminar will take place on Zoom on Wednesday, May 27 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/96694365966?pwd=zKfG645I6EsAVTJxMtdND3EzMYtHB4.1 Meeting ID: 966 9436 5966 Passcode: 366125 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. We study a surgery sequencing and scheduling problem with uncertain surgery durations under the commonly used “to-follow” policy, where surgeries are performed sequentially and immediately after one another according to a predetermined schedule. Motivated by real hospital data, we develop a mathematical framework based on a punctuality index that balances the probability and severity of both delays and idle time. We propose an exact solution approach using Benders decomposition and show that the scheduling problem is polynomial-time solvable when the sequence is fixed. The framework also extends to a robust setting when duration distributions are not fully known. For practical sequencing decisions, we develop two efficient heuristics. Computational results show that our approach outperforms risk-neutral and probability-maximizing benchmarks, reduces extreme delays and idle time, and provides implementable decision-support tools for operating theater managers. The next talk in our series will be: Danny Segev (Tel Aviv University) | June 10 | New Approximation Guarantees for The Inventory Staggering Problem. For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan -- 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

Debiao Li (Fuzhou University) | May 13 | Feature-driven Robust Stochastic Scheduling for Printed Circuit Board Assembly
by Zdenek Hanzalek 11 May '26

11 May '26

Dear scheduling researcher, We are delighted to announce the talk given by Debiao Li (Fuzhou University). The title is "Feature-driven Robust Stochastic Scheduling for Printed Circuit Board Assembly". The seminar will take place on Zoom on Wednesday, May 13 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/94170422099?pwd=XOpJ7g8jqnVkVSE7fdvdoBKFlpmjZE.1 Meeting ID: 941 7042 2099 Passcode: 003670 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Motivated by an industry project, this talk addresses scheduling in printed circuit board assembly (PCBA), a bottleneck of electronic manufacturing. We consider uncertain processing and setup times arising from machine variability and human intervention and model the problem as identical parallel machine scheduling to minimize total completion time and makespan. We develop a feature-driven robust stochastic optimization model that embeds production features into decision-making: processing times are predicted via support vector regression, while setup uncertainty is captured through event-wise ambiguity sets constructed by K-means clustering. The model is reformulated as a mixed-integer linear program and solved using a branch-and-price (B&P) algorithm. Experiments on real-world data show that the proposed approach outperforms sample average approximation (SAA) and standard distributionally robust optimization (DRO) by 52% and 33%, respectively. The B&P algorithm scales well to realistic instances, and sensitivity analysis reveals the impact of setup scenarios on the trade-off between solution quality and computational effort. The next talk in our series will be Danny Segev (Tel Aviv University) | June 10 | New Approximation Guarantees for The Inventory Staggering Problem. For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan -- 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