Methods for solving the problem of minimizing the total tardiness time divinity jobs with policy terms to meet the following computing resources are considered and analyzed. Investigated heuristic algorithms for the solution of the ranking based approach. The performed numerical experiments to validate the effectiveness of the algorithms studied by calculating the relative error and time complexity for different realizations of the input queue of jobs. Proved by the use of algorithms in real-time systems.
resource, Hamiltonian path, optimal schedule, the time delay, the due date, an error, the time complexity
"Doslidzhennia alhorytmiv minimizatsii sumarnoho chasu zapizniuvannia zavdan z dyrektyvnymy strokamy vykonannia na osnovi ranhovoho pidkhodu" ,
Information Processing Systems,