Computational results for very large air crew scheduling problems
AbstractThe airline crew scheduling problem is typically formulated as a set covering problem. The Federal Express Corporation has recently implemented a heuristic crew scheduling system based on this model. The system has been implemented on an IBM 3033 computer. Computational results are presented for crew scheduling problems with up to 3000 rows and 15,000 columns. Results of operational quality are obtained in less than one hour of computer time. This model provides a prototype for a wide variety of large scale crew scheduling applications.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Omega.
Volume (Year): 9 (1981)
Issue (Month): 6 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.
- Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.