Hostname: page-component-77c78cf97d-sp94z Total loading time: 0 Render date: 2026-04-25T15:07:44.886Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model

Published online by Cambridge University Press:  27 July 2009

Esther Frostig
Esther Frostig
Affiliation:
Department of Statistics University of Haifa Mount Carmel, Haifa 31999, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 5 , Issue 3 , July 1991 , pp. 349 - 354
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. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Birge, J., Frenk, J.B.O., Mittenthal, J., & Rinnooy, Kan A.H.G. (1991). Single machine scheduling subject to stochastic breakdowns. Naval Research Logistics Quarterly 37: 661–677.3.0.CO;2-3>CrossRefGoogle Scholar
Glazebrook, K.D. (1984). Scheduling stochastic jobs on a single machine subject to breakdowns. Naval Research Logistics Quarterly 31: 251–264.CrossRefGoogle Scholar
Glazebook, K.D. (1987). Evaluating the effects of machine breakdowns in stochastic scheduling problems. Naval Research Logistics Quarterly 34: 319–335.3.0.CO;2-5>CrossRefGoogle Scholar
Glazebook, K.D. (1990). On non-preemptive policies for stochastic single machine scheduling with breakdowns. Naval Research Logistics Quarterly (to appear).Google 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: 41–49.CrossRefGoogle Scholar
Righter, R. & Shanthikumar, J.G. (1989). Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probability in the Engineering and Informational Sciences 3: 323–333.CrossRefGoogle Scholar
Ross, S.M. (1983). Introduction to stochastic dynamic programming. Series in Probability and Mathematical Statistics. New York: Academic Press, Inc.Google Scholar