Cart (Loading....) | Create Account
Close category search window
 

Approximation for preemptive scheduling stochastic jobs on identical parallel machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaoyong Tang ; Sch. of Comput. & Commun., Hunan Univ., Changsha, China ; Kenli Li ; Fan Wu

In this paper, the stochastic scheduling problem of minimizing the total weighted completion time on preemptive identical parallel machines is investigated. Each job has a processing time, which is a random variable and just given their distribution function. First, we extend the stochastic single-machine preemptive WSEPT rule to a multi-machine list scheduling policy, which we call P-WSEPT. T hen, we use LP based policy to analysis the performance guarantee of preemptive stochastic scheduling with release dates.

Published in:

Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on

Date of Conference:

23-26 Sept. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.