• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

The Schemes Finding of the Approached Decision for the Problems of Scheduling Theory

Скиндерев С., Lazarev A. A.

We consider the approach to construct approximation schedule with the guaranteed absolute error for the $NP-$hard scheduling problems minimizing maximum lateness.