Bounds on optimal values in stochastic scheduling

  title={Bounds on optimal values in stochastic scheduling},
  author={John R. Birge and Kevin D. Glazebrook},
  journal={Oper. Res. Lett.},
Consistent stochastic orders of processing times and objective functions yield optimal policies in many stochastic scheduling problems. When these orders fail to hold, however, finding optimal values may be difficult. In this paper, we show how to bound these values in general situations including problems with unreliable machines and tardiness-based objectives. 

From This Paper

Topics from this paper.
2 Citations
12 References
Similar Papers


Publications citing this paper.
Showing 1-2 of 2 extracted citations


Publications referenced by this paper.
Showing 1-10 of 12 references

Single-Machine Scheduling Subject to Stochastic Breakdown,

  • J. R. Birge, Frenk, J.B.G, J. Mittenthal, A.H.G. Rinnooy Kan
  • Naval Research Logistics
  • 1990
Highly Influential
7 Excerpts

Scheduling,” Chapter 13

  • R. D. Righter
  • Stochastic Orders and their Applications,
  • 1994

Extremal properties of the FIFO discipline in queueing networks,

  • R. D. Righter, J. G. Shantikumar
  • J. Applied Probability
  • 1992

Assessing the Effects of Machine Breakdowns in Stochastic Scheduling,

  • J. R. Birge, K. D. Glazebrook
  • OR Letters
  • 1988

Scheduling Stochastic Jobs on a Single Machine Subject to Breakdowns,

  • K. D. Glazebrook
  • Naval Res. Logist. Qualt
  • 1984

On Stochastic Scheduling Problems with Due Dates,

  • K. D. Glazebrook
  • Int. J. Systems Sci
  • 1983

Similar Papers

Loading similar papers…