About one algorithm for solving scheduling problem

Abstract

© 2015, Pleiades Publishing, Ltd. In this paper we proved the new properties optimal schedules for unknown strongly NP-complete scheduling problem of minimizing maximum lateness on a single machine, not allowing preemption. Pseudopolynomial implementation of the general scheme for solving that problem based on these properties is developed.