@article{ref1,
title="Relaxation approaches to large scale bus driver scheduling problems",
journal="Transportation research part B: methodological",
year="1982",
author="Carraresi, P. and Gallo, G. and Rousseau, Jean Marc",
volume="16",
number="5",
pages="383-397",
abstract="The bus driver scheduling (BDS) problem in a transit company consists of establishing, at minimum cost, a list of work-days in which a driver is assigned to each bus in the given time-table and all clauses of the union contract are respected. In this paper we present a general mathematical programming formulation for the BDS problem. Because, in general, the problem is too large to be solved directly, we introduce a relation of the problem and three different solution approaches. Computational results obtained on real life problems indicate that mathematical programming techniques can solve the BDS problem efficiently.<p /><p>Language: en</p>",
language="en",
issn="0191-2615",
doi="10.1016/0191-2615(82)90020-0",
url="http://dx.doi.org/10.1016/0191-2615(82)90020-0"
}