Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods

Josef Grus, Josef Grus, Claire Hanen, Claire Hanen, Zdeněk Hanzálek

2024

Abstract

We tackle the problem of non-preemptive periodic scheduling with a harmonic set of periods. Problems of this kind arise within domains of periodic manufacturing and maintenance and also during the design of industrial, automotive, and avionics communication protocols, where an efficient static schedule of messages is crucial for the performance of a time-triggered network. We consider the decision variant of the periodic scheduling problem on a single highly-utilized machine. We first prove a bijection between periodic scheduling and a particular 2D packing of rectangles (we name it height-divisible 2D packing). We formulate the problem using Constraint Programming and compare it with equivalent state-of-the-art Integer Linear Programming formulation, showing the former’s superiority on difficult instances. Furthermore, we develop a packing-inspired first fit heuristic, which we compare with methods described in the literature. We justify our proposed methods on problem instances inspired by the communication of messages on one channel.

Download


Paper Citation


in Harvard Style

Grus J., Hanen C. and Hanzálek Z. (2024). Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods. In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES; ISBN 978-989-758-681-1, SciTePress, pages 101-112. DOI: 10.5220/0012325800003639


in Bibtex Style

@conference{icores24,
author={Josef Grus and Claire Hanen and Zdeněk Hanzálek},
title={Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods},
booktitle={Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES},
year={2024},
pages={101-112},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012325800003639},
isbn={978-989-758-681-1},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES
TI - Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
SN - 978-989-758-681-1
AU - Grus J.
AU - Hanen C.
AU - Hanzálek Z.
PY - 2024
SP - 101
EP - 112
DO - 10.5220/0012325800003639
PB - SciTePress