A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory

  • Authors:

  • O. N. Shul'gina

  • Affiliations:

  • Kazan State University, Kazan, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.