Complexity of Scheduling for DARP with Soft Ride Times.
Janka ChlebíkováClément DallardNiklas PaulsenPublished in: CIAC (2019)
Keyphrases
- hard constraints
- scheduling problem
- real world
- worst case
- computational complexity
- decision problems
- bayesian networks
- resource requirements
- database
- resource constraints
- computational cost
- special case
- artificial neural networks
- lower bound
- case study
- decision trees
- information systems
- machine learning
- neural network
- data sets
- real time