We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Scheduling with random processing times to minimize completion time variance on a single machine subject to stochastic breakdowns

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

1 Author(s)
Chunfu Jia ; Coll. of Inf. technology & Sci., Nankai Univ., Tianjin, China

This paper addresses a problem of scheduling n jobs with random processing times on a single machine which is subject to stochastic breakdowns. The objective is to determine a job schedule to minimize the expected completion time variance. The deterministic equivalent of the stochastic scheduling problem is derived when the counting process N(t) related to the machine uptimes is a generalized Poisson process. Two properties of the optimal schedules, such as V-shaped property, are developed.

Published in:

Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress on  (Volume:1 )

Date of Conference: