A Greedy Algorithm for the Solution of the Classical NP-Hard Scheduling Problem of Minimizing the Total Delay
Crossref DOI link: https://doi.org/10.1134/S0005117921110060
Published Online: 2021-12-22
Published Print: 2021-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Saratov, A. A.
Text and Data Mining valid from 2021-11-01
Version of Record valid from 2021-11-01
Article History
Received: 27 January 2021
Revised: 28 May 2021
Accepted: 30 June 2021
First Online: 22 December 2021