Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.

Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical problem in CPU scheduling in time sharing operating systems. A widely used measure for the responsiveness of the system is the average flow time of the jobs, that is, the...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Journal of the ACM 51, 4 (2004).
1. Verfasser: Becchetti, Luca
Format: Artikel
Sprache:English
Schlagworte: