A single-machine scheduling problem with random processing times
From MaRDI portal
Recommendations
- Minimization of expected variance of completion times on single machine for stochastic jobs
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- A stochastic single machine scheduling with random processing time
- V-shape property for job sequences that minimize the expected completion time variance
- Single machine scheduling with randomly compressible processing times
Cited in
(15)- Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability
- Single machine scheduling with coefficient of variation minimization
- V-shape property for job sequences that minimize the expected completion time variance
- Single machine scheduling when processing times are correlated normal random variables
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Optimal sequences in stochastic single machine shops
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Stability of scheduling with random processing times on one machine
- Single machine scheduling with randomly compressible processing times
- A stochastic single machine scheduling with random processing time
- STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
- The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
- Minimization of expected variance of completion times on single machine for stochastic jobs
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times
- Deterministic and Random Single Machine Sequencing with Variance Minimization
This page was built for publication: A single-machine scheduling problem with random processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734154)
