Title

Some integer programming formulations of the airline crew-scheduling problem

Date of Publication

2000

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Abstract/Summary

This thesis presents some formulations of the Airline Crew Scheduling Problem and their analysis. Airline Crew-Scheduling is one of the most important applications of Set Partitioning Problem, which is a special case of Set Covering Problem.

The paper shows the two methods of crew-scheduling: (i) partitioning the set of flights by a set of pairings, and (ii) partitioning the set of flights by a set of duty periods, then partitioning the set of duty periods by a set of pairings are the same.

The proposition and formulations were taken from the articles of Vance et. al., Airline Crew-Scheduling: A New Decomposition Algorithm . The researchers provided the analysis of the formulations in the problem based on the outputs generated by LINDO.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU10021

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

61 leaves

This document is currently not available here.

Share

COinS