Discrete scheduling and critical utilization

Efficient scheduling is essential for optimizing resource allocation and robust system performance in a wide range of real-life applications. In most of these cases, the success of scheduling largely de -pends on one's ability to ensure that system resources can be utilized to their maximum capacity, yet without overloading the system. In this work, we study the problem of critical utilization and efficient scheduling by considering systems with discrete schedules, widely used in real-life workflows. Using an implementation-based approach, we introduce discrete scheduling by developing its analytic equations, which enables us to express the behavior of the scheduling metrics with respect to system utilization. Using this result, we define critical resource utilization and solve for its exact value as a function of schedule length. Finally, we compare our results with the equations from the classical queueing theory, and discuss their applicability. Our findings have immediate practical implications in developing robust schedules and controlling for optimal system performance.& COPY; 2023 Elsevier B.V. All rights reserved.

Automated summary

Efficient scheduling is crucial for optimizing resource allocation and system performance. This study focuses on critical utilization and efficient scheduling in discrete scheduling systems, and compares the results with classical queueing theory.