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

DOI10.1134/S1064562418030201zbMath1401.90077MaRDI QIDQ1673705

Alexander A. Lazarev, Dmitry I. Arkhipov

Publication date: 13 September 2018

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximate solution

Mathematics Subject Classification ID

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

Related Items (3)

A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Metric approach for finding approximate solutions of scheduling problems ⋮ A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay

Cites Work

• Minimization of the maximal lateness for a single machine
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Unnamed Item

This page was built for publication: Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem