Title
Parallel algorithms for airline crew planning on networks of workstations
Abstract
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication patterns. The parallelization of the successful sequential system of Carmen Systems AB guarantees that the results are immediately useful and applicable to a large number of airlines scheduling problems. The parallel pairing generator component of the crew scheduling process achieves a linear speedup on the number of processors and can be efficiently scaled to a large number of processors. The novel parallel optimizer approach of the paper also achieves almost linear speedups for large problems solved on a small number of workstations. The Lufthansa problems that were used in our experiments validate our theoretical results and prove the value and usefulness of our work.
Year
DOI
Venue
1998
10.1109/ICPP.1998.708465
Minneapolis, MN
Keywords
Field
DocType
local area networks,parallel algorithms,parallel processing,travel industry,Carmen Systems AB,Lufthansa problems,airline crew planning,computational techniques,networks of workstations,parallel algorithms,parallel optimizer approach,parallel pairing generator component
Analysis of parallel algorithms,Computer science,Scheduling (computing),Parallel algorithm,Parallel computing,Embarrassingly parallel,Crew scheduling,Workstation,Cost efficiency,Distributed computing,Speedup
Conference
ISSN
ISBN
Citations 
0190-3918
0-8186-8650-2
6
PageRank 
References 
Authors
0.58
8
3
Name
Order
Citations
PageRank
Christos Goumopoulos110418.60
Panayiotis Alefragis212014.33
Efthymios Housos321914.71