<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <nonSort>A </nonSort>
    <title>PC-based heuristic infinite capacity job shop scheduler</title>
  </titleInfo>
  <name type="personal">
    <namePart>Nay Win</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Bohez, Erik L.J.</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Tabucanon, Mario T.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Pastijn, Hugo</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>DAAD (German Academic Exchange Service)</namePart>
    <role>
      <roleTerm type="text">Scholarship Donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1994</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>81 leaves</extent>
  </physicalDescription>
  <abstract>In this study, a microcomputer based job shop production system is implemented by using  a proposed job shop heuristic method. The study also presents a two stage heuristic algorithm for  job shop scheduling problems with due dates wherein the objectives are to minimize number of  tardy jobs and total tardiness. A Ga ntt chart of a resultant schedule is displayed on a computer  screen. A proposed heuristic in this study gives improvement in performance measures and a  runtime of the the algorithm is fast. The due date estimation can be performed quickly. The  application of the algorithm is demonstrated with example problems.</abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of  Engineering, School of Engineering and Technology</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1994</note>
  <subject authority="lcsh">
    <topic>Scheduling (Management)</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. IE-94-26</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B15420</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B15420</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">030798</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818171344.0</recordChangeDate>
  </recordInfo>
</mods>
