Scheduling problems with random processing times under expected earliness/tardiness costs
From MaRDI portal
Publication:4487018
DOI10.1080/07362990008809680zbMath0955.90039OpenAlexW1976485452MaRDI QIDQ4487018
No author found.
Publication date: 5 March 2001
Published in: Stochastic Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07362990008809680
Related Items
Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns ⋮ Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs ⋮ Scheduling deteriorating jobs on a single machine subject to breakdowns ⋮ Bi-objective single machine scheduling problem with stochastic processing times
Cites Work
- Unnamed Item
- Unnamed Item
- Survey of scheduling research involving due date determination decisions
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- Bounds on optimal values in stochastic scheduling
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- A Review of Production Scheduling
- Minimising Waiting Time Variance in the Single Machine Problem
- Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
- Introduction to Stochastic Programming
- The single-machine absolute-deviation early-tardy problem with random completion times
- Single-machine scheduling subject to stochastic breakdowns
- Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
