<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-19T11:58:12Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/84589" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/84589</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_14791</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_14790</setSpec>
        <setSpec>com_2142_9216</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:date>10000-01-01</dc:date>
          <dc:date>1997</dc:date>
          <dc:contributor>Narayan Raman</dc:contributor>
          <dc:creator>Sinha, Sanjeev</dc:creator>
          <dc:date>2015-09-25T22:21:46Z</dc:date>
          <dc:date>2015-09-25T22:21:46Z</dc:date>
          <dc:date>1997</dc:date>
          <dc:description>The second problem requires jobs to be processed at two stages. Each stage consists of identical parallel machines. The processing time is assumed to include the setup time. This problem is also modeled as a mathematical program. Solution approaches and lower bounding procedures are discussed. I develop lower bounds and heuristic approaches and establish their performance through comprehensive computational experiments.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T22:21:46Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
9737253.pdf: 3322729 bytes, checksum: 9c1b2b34f69528aeef8833356e26a7a5 (MD5)
  Previous issue date: 1997</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 85870
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>71 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/84589</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI9737253</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Business Administration, General</dc:subject>
          <dc:title>Parallel Machine Scheduling in Manufacturing Systems: Impact of a Shared Resource and Multiple Stages</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Business Administration</department>
            <discipline>Business Administration</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
