A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay

DOI10.1134/S0005117921110060zbMath1481.90188OpenAlexW4200564575MaRDI QIDQ2069704

A. A. Saratov

Publication date: 21 January 2022

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117921110060

zbMATH Keywords

greedy algorithmscheduling theoryone devicetotal delay minimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem

This page was built for publication: A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay