TY - CONF A1 - Bortoletto, Enrico A1 - Lindner, Niels A2 - Voigt, Guido A2 - Fliedner, Malte A2 - Haase, Knut A2 - Brüggemann, Wolfgang A2 - Hoberg, Kai A2 - Meissner, Jörn T1 - Scaling and Rounding Periodic Event Scheduling Instances to Different Period Times T2 - Operations Research Proceedings 2023 N2 - The Periodic Event Scheduling Problem (PESP) is a notoriously hard combinatorial optimization problem, essential for the design of periodic timetables in public transportation. The coefficients of the integer variables in the standard mixed integer linear programming formulations of PESP are the period time, e.g., 60 for a horizon of one hour with a resolution of one minute. In many application scenarios, lines with different frequencies have to be scheduled, leading to period times with many divisors. It then seems natural to consider derived instances, where the period time is a divisor of the original one, thereby smaller, and bounds are scaled and rounded accordingly. To this end, we identify two rounding schemes: wide and tight. We then discuss the approximation performance of both strategies, in theory and practice. Y1 - 2025 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/10188 SP - 397 EP - 402 ER -