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

Book chapter

Single machine scheduling: an upper bound on maximum lateness

P. 64.
Lazarev A. A., Arkhipov D. I.

The following classical NP-complete scheduling problem is considered.

In book

Single machine scheduling: an upper bound on maximum lateness
Катания: University of Catania, 2015.