Estimation of the Absolute Error and Polynomial Solvability for a Classical NP-Hard Scheduling Problem
Sign Up to like & getrecommendations! Published in 2018 at "Doklady Mathematics"
DOI: 10.1134/s1064562418030201
Abstract: A method for finding an approximate solution for NP-hard scheduling problems is proposed. The example of the classical NP-hard in the strong sense problem of minimizing the maximum lateness of job processing with a single… read more here.
Keywords: absolute error; classical hard; problem; hard scheduling ... See more keywords