Bounds on optimal values in stochastic scheduling

DOI10.1016/S0167-6377(97)00017-5zbMath0888.90086OpenAlexW2168898126MaRDI QIDQ1375116

John R. Birge, Kevin D. Glazebrook

Publication date: 12 January 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00017-5

zbMATH Keywords

stochastic schedulingunreliable machinesstochastic orders of processing timestardiness-based objectives

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Scheduling problems with random processing times under expected earliness/tardiness costs ⋮ Single–machine scheduling with random machine breakdowns and randomly compressible processing times ⋮ Combinatorial optimization: current successes and directions for the future ⋮ Dynamic scheduling of stochastic jobs on a single machine ⋮ Minimizing the expected number of tardy jobs when processing times are normally distributed

Cites Work

• Unnamed Item
• Unnamed Item
• Assessing the effects of machine breakdowns in stochastic scheduling
• Rearrangement, Majorization and Stochastic Scheduling
• Scheduling stochastic jobs on a single machine subject to breakdowns
• On stochastic scheduling problems with due dates
• On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
• Single Machine Scheduling Problem When the Machine Capacity Varies Stochastically
• Extremal properties of the FIFO discipline in queueing networks
• Stochastic scheduling with order constraints
• Single-machine scheduling subject to stochastic breakdowns

This page was built for publication: Bounds on optimal values in stochastic scheduling