Utilization of nonclairvoyant online schedules

Authors:
Mohamed Eid Hussein;Uwe Schwiegelshohn
Affiliations:
Mathematics Department of South Valley University, Aswan, Egypt;Robotics Research Institute, University Dortmund, Dortmund, Germany
Venue:
Theoretical Computer Science
Year:
2006

Citing 7
Cited 1

Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling Parallel Machines On-line

SIAM Journal on Computing
Better Bounds for Online Scheduling

SIAM Journal on Computing
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
On an on-line scheduling problem for parallel jobs

Information Processing Letters
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Minimizing flow time nonclairvoyantly

Journal of the ACM (JACM)

Efficient algorithms for average completion time scheduling

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	5.23

Visualization

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.