<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>02700nam a2200397   4500</leader>
  <controlfield tag="005">20260817172256.0</controlfield>
  <controlfield tag="008">               th                  eng  </controlfield>
  <controlfield tag="008">170398         th                  eng  </controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">.b10024621</subfield>
  </datafield>
  <datafield tag="099" ind1=" " ind2="9">
    <subfield code="a">AIT Thesis no. 1154</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Yuen Poovarawan</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
    <subfield code="a">A case study on nxm job shop scheduling problem using heuristic approach</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Bangkok :</subfield>
    <subfield code="b">Asian Institute of Technology,</subfield>
    <subfield code="c">1976</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">77 p.</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Thesis ;</subfield>
    <subfield code="v">no. 1154</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Thesis (M.Eng.) - Asian Institute of Technology, 1976</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">This study describes a heuristic algorithm for seeking a quick  and near optimal solution to the n jobs m machines job shop  scheduling problem in which each job 4as a number of operations to be performed on the specified machines in an ordering which are not the  same for all jobs. The model can handle different machines required sequences including l oops, job precedence structure and start- stop lag. The objective is to minimize the total operation time. The developed heuristic algorithm is an extensions of the heuristic rules of the jobs two machines scheduling problem.  At any instant during the n  operation the m machines problem can be converted into a two machine problem. One of this is the machine under consideration and the other machine represents the rest of the machines required by the job  through the first one. In this study, the model has been applied to solve a real-world problem. The results are observed to be sat is factory. </subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Scheduling (Management)</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Sharif, M. N., </subfield>
    <subfield code="e">Chairperson</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Pakorn Adulbhan, </subfield>
    <subfield code="e">Examination Committee</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Techapun Raengkhum, </subfield>
    <subfield code="e">Examintion Committee</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">Kasetsart University, </subfield>
    <subfield code="e">Scholarship Donor</subfield>
  </datafield>
  <datafield tag="810" ind1="2" ind2=" ">
    <subfield code="a">Asian Institute of Technology.</subfield>
    <subfield code="t">Thesis ;</subfield>
    <subfield code="v">no. 1154</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="3">Full-Text</subfield>
    <subfield code="u">http://203.159.5.9/ait-thesis/detail.php?q=B23919</subfield>
  </datafield>
  <datafield tag="907" ind1=" " ind2=" ">
    <subfield code="a">.b10024621</subfield>
    <subfield code="b">mnait</subfield>
    <subfield code="c">x</subfield>
  </datafield>
  <datafield tag="902" ind1=" " ind2=" ">
    <subfield code="a">260410</subfield>
  </datafield>
  <datafield tag="998" ind1=" " ind2=" ">
    <subfield code="b">3</subfield>
    <subfield code="c">951012</subfield>
    <subfield code="d">m</subfield>
    <subfield code="e">a  </subfield>
    <subfield code="f">x</subfield>
    <subfield code="g">2</subfield>
  </datafield>
  <datafield tag="945" ind1=" " ind2=" ">
    <subfield code="l">mnait</subfield>
  </datafield>
  <datafield tag="945" ind1=" " ind2=" ">
    <subfield code="l">mnarc</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">20</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">40</subfield>
  </datafield>
  <datafield tag="909" ind1=" " ind2=" ">
    <subfield code="a">Barcode : 30050003022844</subfield>
    <subfield code="b">CREATED : 1994-05-16</subfield>
    <subfield code="c">RECORD # : i10005584</subfield>
    <subfield code="d">LPATRON : 1014771</subfield>
    <subfield code="e">LCHKIN : 2001-07-15</subfield>
    <subfield code="f"># RENEWALS : 0</subfield>
    <subfield code="g"># OVERDUE : 0</subfield>
    <subfield code="h">IUSE3 : 0</subfield>
    <subfield code="i">TOT CHKOUT : 3</subfield>
    <subfield code="j">TOT RENEW : 0</subfield>
  </datafield>
  <datafield tag="909" ind1=" " ind2=" ">
    <subfield code="a">Barcode : 30050160087754</subfield>
    <subfield code="b">CREATED : 2016-04-05</subfield>
    <subfield code="c">RECORD # : i12971406</subfield>
    <subfield code="d">LPATRON : 0</subfield>
    <subfield code="e">LCHKIN : -</subfield>
    <subfield code="f"># RENEWALS : 0</subfield>
    <subfield code="g"># OVERDUE : 0</subfield>
    <subfield code="h">IUSE3 : 0</subfield>
    <subfield code="i">TOT CHKOUT : 0</subfield>
    <subfield code="j">TOT RENEW : 0</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">15466</subfield>
    <subfield code="d">15466</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">mnait</subfield>
    <subfield code="d">2026-08-17</subfield>
    <subfield code="g">10.00</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">AIT Thesis no. 1154</subfield>
    <subfield code="p">30050003022844</subfield>
    <subfield code="r">2026-08-17 17:22:56</subfield>
    <subfield code="t">2</subfield>
    <subfield code="w">2026-08-17</subfield>
    <subfield code="y">20</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">mnarc</subfield>
    <subfield code="d">2026-08-17</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">AIT Thesis no. 1154</subfield>
    <subfield code="p">30050160087754</subfield>
    <subfield code="r">2026-08-17 17:22:56</subfield>
    <subfield code="w">2026-08-17</subfield>
    <subfield code="y">40</subfield>
  </datafield>
</record>
