A Rolling Horizon Heuristic with Optimality Guarantee for an On-Demand Vehicle Scheduling Problem.
Johann HartlebMarie SchmidtPublished in: ATMOS (2020)
Keyphrases
- rolling horizon
- single machine
- scheduling problem
- multi depot
- processing times
- lot sizing
- np hard
- flowshop
- tabu search
- sequence dependent setup times
- setup times
- maximum lateness
- release dates
- optimal solution
- production scheduling
- job shop scheduling problem
- precedence constraints
- unrelated parallel machines
- asymptotic optimality
- minimizing makespan
- list scheduling
- pedestrian detection
- real time
- parallel machines
- single machine scheduling problem
- strongly np hard
- machine learning
- upper bound
- permutation flowshop
- metaheuristic
- greedy algorithm
- exhaustive search
- vehicle detection