<?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-21T11:11:10Z</responseDate>
  <request identifier="2144" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2144</identifier>
        <datestamp>2024-03-06T10:28:40Z</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>Scheduling Aircraft to Reduce Controller Workload</dc:title>
          <dc:creator>Kim, Joondong</dc:creator>
          <dc:creator>Kroeller, Alexander</dc:creator>
          <dc:creator>Mitchell, Joseph</dc:creator>
          <dc:subject>Air Traffic Management</dc:subject>
          <dc:subject>trajectory scheduling</dc:subject>
          <dc:subject>flight plan scheduling</dc:subject>
          <dc:subject>no-wait job shop Air Traffic Management</dc:subject>
          <dc:subject>trajectory scheduling</dc:subject>
          <dc:subject>flight plan scheduling</dc:subject>
          <dc:subject>no-wait job shop</dc:subject>
          <dc:description>We address a problem in air traffic management: scheduling flights&#13;
in order to minimize the maximum number of aircraft that&#13;
simultaneously lie within a single air traffic control sector at&#13;
any time $t$.  Since the problem is a generalization of the NP-hard&#13;
no-wait job-shop scheduling, we resort to heuristics. We report&#13;
experimental results for real-world flight data.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Joondong Kim and Alexander Kroeller and Joseph Mitchell</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (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/OASIcs.ATMOS.2009.2144</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21443</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2144</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
