2026-07-23T20:44:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9711 2024-03-06T10:30:26Z ddc:004 open_access

Tree Decomposition Methods for the Periodic Event Scheduling Problem van Heuven van Staereling, Irving Dynamic Programming Trees Periodic Event Scheduling Problem This paper proposes an algorithm that decomposes the Periodic Event Scheduling Problem (PESP) into trees that can efficiently be solved. By identifying at an early stage which partial solutions can lead to a feasible solution, the decomposed components can be integrated back while maintaining feasibility if possible. If not, the modifications required to regain feasibility can be found efficiently. These techniques integrate dynamic programming into standard search methods. The performance of these heuristics are very satisfying, as the problem using publicly available benchmarks can be solved within a reasonable amount of time, in an alternative way than the currently accepted leading-edge techniques. Furthermore, these heuristics do not necessarily rely on linearity of the objective function, which facilitates the research of timetabling under nonlinear circumstances. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Irving van Heuven van Staereling 2018 Is Part Of OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2018.6 urn:nbn:de:0030-drops-97112 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.6 eng https://creativecommons.org/licenses/by/3.0/legalcode