Two-at-a-strike: optimized dynamic scheduling for ADAC and elevators
From MaRDI portal
Recommendations
- Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
- scientific article; zbMATH DE number 1947428
- Online-Optimization of Large-Scale Vehicle Dispatching Problems
- A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
- OR PRACTICE—The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment
Cited in
(9)- Learning vehicle dispatching with linear programming models
- Dynamic dispatching and repositioning policies for fast-response service networks
- Real-time algorithms for the bilevel double-deck elevator dispatching problem
- Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- The synchronization of elevators when not all passengers will ride the first-arriving elevator
- Assignment formulation for the elevator dispatching problem with destination control and its performance analysis
- scientific article; zbMATH DE number 1947428 (Why is no real title available?)
- Robust discrete optimization scheduling strategy for an elevator group control system
This page was built for publication: Two-at-a-strike: optimized dynamic scheduling for ADAC and elevators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960760)
