Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems.
Janka ChlebíkováClément DallardNiklas PaulsenPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- resource constraints
- hard constraints
- scheduling problem
- constraint satisfaction
- computational cost
- parallel machines
- precedence constraints
- scheduling algorithm
- constraint programming
- constrained optimization
- decision problems
- worst case
- real time
- space complexity
- constraint satisfaction problems
- linear constraints
- special case
- round robin
- data sets