Stochastic scheduling with optimal customer service
From MaRDI portal
Recommendations
Cited in
(11)- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
- Home service routing and appointment scheduling with stochastic service times
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Johnson's problem with stochastic processing times and optimal service level
- Setting due dates in a stochastic single machine environment
- Makespan-related criteria for comparing schedules in stochastic environments
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- Multi-Agent Customer Allocation in a Stochastic Service System
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Online traveling salesman problem with deadlines and service flexibility
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
This page was built for publication: Stochastic scheduling with optimal customer service
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658401)
