By Topic

A note on single machine scheduling subject to stochastic breakdowns with regular cost functions

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

4 Author(s)
Congdian Cheng ; Coll. of Math. & Syst. Sci., Shenyang Normal Univ., Shenyang ; Lihua Zhang ; Henyong Tang ; Chuanli Zhao

We addresses the single machine scheduling subject to stochastic breakdowns with regular cost functions. Both the preempt-resume version and preempt-repeat version problems are examined by analysis method. Importantly, the SPT Policy for the preempt-resume version problem is extended to the preempt-repeat version problem with uptimes no memory.

Published in:

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on  (Volume:2 )

Date of Conference:

12-15 Oct. 2008