A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory

Abstract

The well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal tardiness, is investigated. New properties of the optimal schedule are derived and used to develop a new scheme for solving the above problem.