By Topic

Analysis of the Completion Time for the Job Processed on a 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)
Congdian Cheng ; Coll. of Math. & Syst. Sci., Shenyang Normal Univ., Shenyang, China

This article addresses the completion time of a job processed on a machine subject to the sequence stochastic breakdowns described by Birge et. al (1990). I present an general analysis on the first and second moments of the completion time. Let r and p denote respectively the starting time and processing time of the job. My contributions can be roughly stated as follows. (A) For the resume case, if r and p possess finite first and second moments, then the completion time has finite second moment. (B) For the repeat case, if r and p possess first and second moments and Pr{Uk ¿ p} > 0, where Uk represents the kth uptime, then the completion time has finite second moment.

Published in:

Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on

Date of Conference:

19-20 Dec. 2009