Single-machine scheduling to stochastically minimize maximum lateness

DOI10.1007/S10951-007-0026-8zbMath1168.90487OpenAlexW2065803401MaRDI QIDQ835562

Xian Zhou, Xiaoqiang Cai, Liming Wang

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0026-8

zbMATH Keywords

stochastic orderstochastic schedulingrandom due datesdeterministic or stochastic processing timesmaximum weighted lateness

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (5)

Minimizing makespan for scheduling stochastic job shop with random breakdown ⋮ Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns ⋮ Analysis of computer job control under uncertainty ⋮ Single machine scheduling with stochastically dependent times ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• General stochastic single-machine scheduling with regular cost functions
• Single-machine scheduling with exponential processing times and general stochastic cost functions
• Rearrangement, Majorization and Stochastic Scheduling
• Bivariate characterization of some stochastic order relations
• Optimal issuing policies under stochastic field lives

This page was built for publication: Single-machine scheduling to stochastically minimize maximum lateness