Driver scheduling problem

The driver scheduling problem (DSP) is type of problem in operations research and theoretical computer science. The DSP consists of selecting a set of duties (assignments) for the drivers or pilots of vehicles (e.g., buses, trains, boats, or planes) involved in the transportation of passengers or goods, within the constraints of various legislative and logistical criteria.

Comment
enThe driver scheduling problem (DSP) is type of problem in operations research and theoretical computer science. The DSP consists of selecting a set of duties (assignments) for the drivers or pilots of vehicles (e.g., buses, trains, boats, or planes) involved in the transportation of passengers or goods, within the constraints of various legislative and logistical criteria.
Has abstract
enThe driver scheduling problem (DSP) is type of problem in operations research and theoretical computer science. The DSP consists of selecting a set of duties (assignments) for the drivers or pilots of vehicles (e.g., buses, trains, boats, or planes) involved in the transportation of passengers or goods, within the constraints of various legislative and logistical criteria.
Hypernym
Problem
Is primary topic of
Driver scheduling problem
Label
enDriver scheduling problem
Link from a Wikipage to another Wikipage
Algorithm
Category:Algorithms
Crew scheduling
Deadheading (employee)
Operations research
Optimization
Set covering
Theoretical computer science
SameAs
Driver scheduling problem
fUwU
m.0vp9h0s
Q17088666
Subject
Category:Algorithms
WasDerivedFrom
Driver scheduling problem?oldid=1074901821&ns=0
WikiPageLength
3779
Wikipage page ID
39456471
Wikipage revision ID
1074901821
WikiPageUsesTemplate
Template:Reflist