Chapter

Online Algorithms

Volume 1442 of the series Lecture Notes in Computer Science pp 196-231

Date:

On-line scheduling

  • JiŘí Sgall

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We have seen a variety of on-line scheduling problems. Many of them are understood satisfactorily, but there are also many interesting open problems. Studied scheduling problems differ not only in the setting and numerical results, but also in the techniques used. In this way on-line scheduling illustrates many general aspects of competitive analysis.