Abstract
An efficient method for solving the classical NP-hard problem of scheduling theory for one device—the problem of minimizing the total delay \(1||\sum T_{j} \)—is presented. An algorithm for solving the problem is proposed based on the decomposition of the original problem into subproblems of timely servicing each of the requests and placing those of them for which the increase in the delay is most compensated for by the reduction in the delay of the previous requests at the end of the schedules. The complexity of the algorithm does not exceed \(O\left (n^{2}\right ) \) operations, where \(n \) is the number of requests.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Lazarev, A.A. and Gafarov, E.R., Teoriya raspisanii. Zadachi i algoritmy (Scheduling Theory. Problems and Algorithms), Moscow: Izd. Mosk. Gos. Univ., 2011.
Lazarev, A.A. and Arkhipov, D.I., Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem, Dokl. Math., 2018, vol. 97, no. 3, pp. 262–265.
Saratov, A.A., Coordination of production cycles by the method of mutual penalties, Avtom. Protsess. Upr., 2019, no. 1, pp. 66–73.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by V. Potapchouck
Rights and permissions
About this article
Cite this article
Saratov, A.A. A Greedy Algorithm for the Solution of the Classical NP-Hard Scheduling Problem of Minimizing the Total Delay. Autom Remote Control 82, 1907–1911 (2021). https://doi.org/10.1134/S0005117921110060
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117921110060