[Scheduling seminar] Pieter Smet (KU Leuven) | Robustness in personnel rostering
Вставка
- Опубліковано 8 гру 2024
- Keywords: Personnel rostering, Robustness, On-call shift rostering, Operations research, Machine learning
We consider a variant of the simple assembly line balancing problem in which the number of workstations and the cycle time are fixed, but some tasks are subjected to uncertainty (processing times can increase). The purpose is to maintain the schedule feasibility when the duration of tasks increases. To achieve this, we consider two stability measures (to be maximized): the stability radius, and the stability factor, that correspond to different types of task duration increase. The scheduling problem is formulated as a mixed integer linear program, and this formulation is strengthened by an upper bound and a heuristic. More specifically, the allocation intervals of the tasks, that are based on precedence constraints, are narrowed, which in turn are used to improve the results of the heuristic and the mixed integer linear programming formulation.
Organized by Zdenek Hanzalek (CTU in Prague), Michael Pinedo (New York University), and Guohua Wan (Shanghai Jiao Tong).
Seminar's webpage: schedulingsemi...
Awesome, thanks for this! Working through some OR-Tools implementations right now, and this helped to conceptualize!