Skip to main content Accessibility help
×
Home

On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns

Published online by Cambridge University Press:  27 July 2009

Kevin D. Glazebrook
Affiliation:
Department of Mathematics and Statistics University of Newcastle upon Tyne, Newcastle upon Tyne, NE1 7RU, U.K.

Abstract

A set of stochastic jobs is to be processed on a single machine that is subject to breakdown. All jobs make progress as they are processed in the absence of machine breakdowns. However, breakdowns cause setbacks to (possibly) all jobs in the system, except those that have already been completed. With machines subject only to fairly mild restrictions on this “damage” process, we demonstrate the existence of a nonpreemptive policy that is optimal in the class of all preemptive ones.

Type
Articles
Copyright
Copyright © Cambridge University Press 1991

Access options

Get access to the full version of this content by using one of the access options below.

References

Barlow, R.E. & Proschan, F. (1975). Statistical theory of reliability and life testing. New York: Holt, Rinehart and Winston.Google Scholar
Birge, J., Frenk, J.B.G., Mittenthal, J., & Rinnooy, Kan A.H.G. (1990). Single machine scheduling subject to stochastic breakdowns. Naval Research Logistics 37: 661677.3.0.CO;2-3>CrossRefGoogle Scholar
Gittins, J.C. (1979). Bandit processes and dynamic allocation indices (with discussion). Journal of the Royal Statistical Society B41: 148164.Google Scholar
Glazebrook, K.D. (1981). On non-preemptive strategies in stochastic scheduling. Naval Research Logistics Quarterly 28: 289300.CrossRefGoogle Scholar
Glazebrook, K.D. (1983). Methods for the evaluation of permutations as strategies in stochastic scheduling. Management Science 29: 11421155.CrossRefGoogle Scholar
Glazebrook, K.D. (1984). Scheduling stochastic jobs on a single machine subject to breakdowns. Naval Research Logistics Quarterly 31: 251264.CrossRefGoogle Scholar
Glazebrook, K.D. (1987). Evaluating the effects of machine breakdowns in stochastic scheduling problems. Naval Research Logistics Quarterly 34: 319335.3.0.CO;2-5>CrossRefGoogle Scholar
Glazebrook, K.D. & Gittins, J.C. (1981). On single-machine scheduling with precedence relations and linear or discounted costs. Operations Research 29: 161173.CrossRefGoogle Scholar
Meilijson, I. & Weiss, G. (1977). Multiple feedback at a single server station. Stochastic Processes Applications 5: 195205.CrossRefGoogle Scholar
Nash, P. & Gittins, J.C. (1977). A Hamiltonian approach to optimal stochastic resource allocation. Advances in Applied Probability 9: 5568.CrossRefGoogle Scholar
Pinedo, M. & Rammouz, E. (1988). A note on stochastic scheduling on a single machine subject to breakdown and repair. Probability in the Engineering and Informational Sciences 2: 4149.CrossRefGoogle Scholar
Righter, R. & Shanthikumar, J.G. (1989). Scheduling multiclass single server queueing systems to stochastically maximise the number of successful departures. Probability in the Engineering and Informational Sciences 3: 323333.CrossRefGoogle Scholar
Ross, S.M. (1970). Applied probability models with optimization applications. San Francisco: Holden-Day.Google Scholar
Stoyan, D. (1983). Comparison methods for queues and other stochastic models. New York: Wiley.Google Scholar
Whittle, P. (1980). Multi-armed bandits and the Gittins' index. Journal of the Royal Statistical Society B42: 143149.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 14 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 18th January 2021. This data will be updated every 24 hours.

Hostname: page-component-77fc7d77f9-xz9qf Total loading time: 0.2 Render date: 2021-01-18T23:59:11.534Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags last update: Mon Jan 18 2021 23:56:14 GMT+0000 (Coordinated Universal Time) Feature Flags: { "metrics": true, "metricsAbstractViews": false, "peerReview": true, "crossMark": true, "comments": true, "relatedCommentaries": true, "subject": true, "clr": true, "languageSwitch": true, "figures": false, "newCiteModal": false, "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *