ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 362, Issues 1-3, 11 October 2006, Pages 238-247
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (208 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
There are no related articles for this article.
 
View Record in Scopus
 
doi:10.1016/j.tcs.2006.06.027    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Utilization of nonclairvoyant online schedules

Mohamed Eid Husseina, E-mail The Corresponding Author and Uwe Schwiegelshohnb, Corresponding Author Contact Information, E-mail The Corresponding Author

aMathematics Department of South Valley University, 81528, Aswan, Egypt bRobotics Research Institute, University Dortmund, 44221 Dortmund, Germany

Received 20 August 2004; 
revised 4 October 2005; 
accepted 27 June 2006. 
Communicated by A. Fiat. 
Available online 21 August 2006.

Purchase the full-text article



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


Theoretical Computer Science
Volume 362, Issues 1-3, 11 October 2006, Pages 238-247
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.