Scheduling problems with random processing times under expected earliness/tardiness costs
From MaRDI portal
Recommendations
- A stochastic single machine scheduling with random processing time
- scientific article; zbMATH DE number 1061797
- Minimizing earliness and tardiness costs in stochastic scheduling
- The stochastic single machine scheduling problem with earliness and tardiness costs
- The single-machine absolute-deviation early-tardy problem with random completion times
Cites work
- A Review of Production Scheduling
- Bounds on optimal values in stochastic scheduling
- scientific article; zbMATH DE number 3906232 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Introduction to Stochastic Programming
- Minimising Waiting Time Variance in the Single Machine Problem
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine scheduling subject to stochastic breakdowns
- Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
- Survey of scheduling research involving due date determination decisions
- The single-machine absolute-deviation early-tardy problem with random completion times
Cited in
(15)- Job selection and sequencing on a single machine in a random environment
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Earliness and tardiness scheduling problems on a batch processor
- Bi-objective single machine scheduling problem with stochastic processing times
- Minimizing earliness and tardiness costs in stochastic scheduling
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- Single machine scheduling with randomly compressible processing times
- A stochastic single machine scheduling with random processing time
- OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
- scientific article; zbMATH DE number 1061797 (Why is no real title available?)
- Optimal scheduling of random works with reliability application
- Scheduling deteriorating jobs on a single machine subject to breakdowns
- Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
- A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
- Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns
This page was built for publication: Scheduling problems with random processing times under expected earliness/tardiness costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487018)