<?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-22T14:20:22Z</responseDate>
  <request identifier="2165" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2165</identifier>
        <datestamp>2024-03-06T11:08:50Z</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>Sequencing and Scheduling in Coil Coating with Shuttles</dc:title>
          <dc:creator>Höhn, Wiebke</dc:creator>
          <dc:creator>König, Felix G.</dc:creator>
          <dc:creator>Lübbecke, Marco E.</dc:creator>
          <dc:creator>Möhring, Rolf H.</dc:creator>
          <dc:subject>Sequencing</dc:subject>
          <dc:subject>scheduling</dc:subject>
          <dc:subject>coil coating</dc:subject>
          <dc:subject>mutli-interval graphs</dc:subject>
          <dc:subject>heuristics</dc:subject>
          <dc:subject>branch and price</dc:subject>
          <dc:description>Applying combinatorial optimization in real life yields cost savings delighting the industry. Beyond that, at the core of some applications also lies a pretty (sub)problem rejoicing the mathematician. In our application coils of sheet metal are coated with k layers out of hundreds of colors. Coils are stapled&#13;
together to run through k coaters, and non-productive time occurs e.g. when the color in a coater needs to be changed. Some coaters have two parallel tanks, enabling either parallel colors or cleaning of one tank during production. We present our sequencing and scheduling scheme in use at the plant today,&#13;
lower bounds proving solution quality, and problems in the edge-wise union of interval graphs as a pretty mathematical subproblem.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Wiebke Höhn and Felix G. König and Marco E. Lübbecke and Rolf H. Möhring</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.26</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21654</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.26</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>
