๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Solving large scale crew scheduling problems in practice

โœ Scribed by E. J. W. Abbink; L. Albino; T. Dollevoet; D. Huisman; J. Roussado; R. L. Saldanha

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
526 KB
Volume
3
Category
Article
ISSN
1866-749X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving large scale crew scheduling prob
Solving large scale crew scheduling problems
โœ Hai D. Chu; Eric Gelman; Ellis L. Johnson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 572 KB

The crew pairing problem is posed as a set partitioning zero-one integer program. Variables are generated as legal pairings meeting all work rules. Dual values obtained from solving successive large linear program relaxations are used to prune the search tree. In this paper we present a graph based