Tight lower bounds for semi-online scheduling on two uniform machines with known optimum

Authors:

Abstract
No abstract available
Funding Information
  • NKFIH (SNN 116095, SNN 116095)
  • National Natural Science Foundation of China (11671356, 11271324)
  • National Natural Science Foundation of China (11471286)
  • European Social Fund Plus (n/a)
  • Széchenyi 2020 (EFOP-3.6.1-16-2016-00015)

This publication has 22 references indexed in Scilit: