Dynamic controllability is the most general criterion to guarantee that a process can be executed without time failures. However, it admits schedules with an undesirable property: starting an activity without knowing its deadline. We analyze the specific constellations of temporal constraints causing such a sudden termination. Consequently, we introduce the somewhat stricter notion of semi-dynamic controllability, and present necessary and sufficient conditions to guarantee that a process can be executed without time failures and without sudden termination. A sound and complete algorithm for checking whether a process is semi-dynamically controllable complements the approach.
CITATION STYLE
Eder, J., Franceschetti, M., & Lubas, J. (2020). Scheduling processes without sudden termination. In Lecture Notes in Business Information Processing (Vol. 387 LNBIP, pp. 117–132). Springer. https://doi.org/10.1007/978-3-030-49418-6_8
Mendeley helps you to discover research relevant for your work.