<?xml version="1.0" encoding="UTF-8"?>
<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-07-19T23:41:39Z</responseDate>
  <request identifier="2178" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2178</identifier>
        <datestamp>2024-03-06T11:08:49Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Increasing Stability of Crew Schedules in Airlines</dc:title>
          <dc:creator>Suhl, Leena</dc:creator>
          <dc:creator>Dück, Viktor</dc:creator>
          <dc:creator>Kliewer, Natalia</dc:creator>
          <dc:subject>Robust planning</dc:subject>
          <dc:subject>crew scheduling</dc:subject>
          <dc:subject>airlines</dc:subject>
          <dc:description>In airline traffic disruptions occur frequently and cannot be totally avoided.&#13;
They may lead to infeasible aircraft and crew schedules during the day of operations, due to absence of resources or violation of crew rules. The process&#13;
of finding new schedules in such cases is called recovery or disruption management. The short-term recovery actions usually imply additional costs meaning that the total operational costs of a crew schedule can be significantly higher than the original planned costs. It is generally desirable to construct the schedule already in the planning phase in such a way that not just the planned costs, but the total operational costs are minimized. The goal is thus to construct schedules which remain feasible or can be recovered without high costs in cases of disturbances. This approach is generally called robust scheduling.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Leena Suhl and Viktor Dück and Natalia Kliewer</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09261.12</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21786</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.12</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
