By Topic

Parallel algorithms for airline crew planning on networks of workstations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Goumopoulos, C. ; Dept. of Electr. & Comput. Eng., Patras Univ., Greece ; Alefragis, P. ; Housos, E.

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

Published in:

Parallel Processing, 1998. Proceedings. 1998 International Conference on

Date of Conference:

10-14 Aug 1998