<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-23T22:18:02Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/8930" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/8930</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">John-Paul Clarke.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Ageeva, Yana (Yana V.), 1976-</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2005-08-23T16:27:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2005-08-23T16:27:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2000</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2000</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/8930</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">48981606</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 93-94).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">The airline scheduling process used by major airlines today aims to develop optimal schedules which maximize revenue. However, these schedules are often far from "optimal" once deployed in the real world because they do not accurately take into account possible weather, air traffic control (ATC), and other disruptions that can occur during operation. The resulting flight delays and cancellations can cause significant revenue loss, not to mention service disruptions and customer dissatisfaction. A novel approach to addressing this problem is to design schedules that are robust to schedule disruptions and can be degraded at any airport location or in any region with minimal impact on the entire schedule. This research project suggests new methods for creating more robust airline schedules which can be easily recovered in the face of irregular operations. We show how to create multiple optimal solutions to the Aircraft Routing problem and suggest how to evaluate robustness of those solutions. Other potential methods for increasing robustness of airline schedules are reviewed.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Yana Ageeva.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">94 p.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">6986477 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">6986234 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Approaches to incorporating robustness into airline scheduling</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="0c98205b-a4fc-4c1e-a0cc-6bfcae530973">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Approaches to incorporating robustness into airline scheduling&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2000&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Ageeva, Yana (Yana V.), 1976-&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>The airline scheduling process used by major airlines today aims to develop optimal schedules which maximize revenue. However, these schedules are often far from &amp;quot;optimal&amp;quot; once deployed in the real world because they do not accurately take into account possible weather, air traffic control (ATC), and other disruptions that can occur during operation. The resulting flight delays and cancellations can cause significant revenue loss, not to mention service disruptions and customer dissatisfaction. A novel approach to addressing this problem is to design schedules that are robust to schedule disruptions and can be degraded at any airport location or in any region with minimal impact on the entire schedule. This research project suggests new methods for creating more robust airline schedules which can be easily recovered in the face of irregular operations. We show how to create multiple optimal solutions to the Aircraft Routing problem and suggest how to evaluate robustness of those solutions. Other potential methods for increasing robustness of airline schedules are reviewed.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>