Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
L’objectif de cette these est de developper un cadre methodologique pour les problemes de tournees de vehicules riches (RVRPs… 
2014
2014
Managing human resource to achieve specific goal in an organisation is a crucial task. One of various aspects in managing human… 
2014
2014
This paper suggests  polynomial time heuristic algorithm to obtain the solution for the driver scheduling problem, DSP, that… 
2014
2014
This paper is about driver scheduling which is categorized as a difficult combinatorial problem. Driver scheduling is the process… 
2014
2014
--In planning an active and proficient public transportation system, essentially every transit system in the world must optimize… 
2008
2008
Train driver scheduling is the problem of finding an assignment of drivers to cover all train vehicle work, such that cost is… 
2005
2005
Although in its former formulations the Bus Driver Scheduling Problem (BDSP) has been considered as a Set Covering Problem there… 
2001
2001
The bus and train driver scheduling problem involves assigning bus or train work to drivers in such a way that all the bus or… 
1998
1998
We present new metaheuristics for solving real crew scheduling problems in a public transportation bus company. Since the crews… 
1997
1997
services requiring continuous updates consists in using a Text-To-Speech synthesis system. This kind of speech synthesis system…