Copyright © 2006 Elsevier B.V. All rights reserved.
Utilization of nonclairvoyant online schedules
Received 20 August 2004;
revised 4 October 2005;
accepted 27 June 2006.
Communicated by A. Fiat.
Available online 21 August 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedules for independent jobs on m identical machines. In our online model, all jobs are submitted over time. We show that the commonly used makespan criterion is not well suited to describe utilization for this online problem. Therefore, we directly address utilization and determine the maximum deviation from the optimal utilization for the given scheduling problem.
Keywords: Online scheduling; Utilization






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)



