Common due-date assignment and scheduling on single machine with exponential processing times.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 519846
- Stochastic single machine scheduling with an exponentially distributed due date
- Single-machine scheduling to minimize earliness and number of tardy jobs
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
Cites work
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
- A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due-date assignment and early/tardy scheduling on identical parallel machines
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Scheduling tasks with exponential service times on parallel processors
- Survey of scheduling research involving due date determination decisions
- The single-machine absolute-deviation early-tardy problem with random completion times
This page was built for publication: Common due-date assignment and scheduling on single machine with exponential processing times.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468636)
