<?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>comparative study on selected search techniques for solving production smoothing problems</title>
  </titleInfo>
  <name type="personal">
    <namePart>Quah, Tiong Choon</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Tang, John C.S.</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart> Pakorn Adulbhan.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Tabucanon, Mario T.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Lee Foundation</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>1979</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>viii, 58 p.</extent>
  </physicalDescription>
  <abstract>This study is directed at applying a more efficient mathematical  programming method in solving the production scheduling problem. The Rosenbrock method of search and geometric programming approach (Blau algorithm) are tested by the objective function of the classic Holt, Modigliani, Muth and Simon's paint factory scheduling problem in a 20 dimension response surface and compare with that obtained by Hooke-Jeeves method of search. The two proposed methods demonstrate the ability to  consistently descend to the neighborhood of the minimum function value reached. The two proposed techniques are then selected for incorporation into  a multi- item formulation, of the production scheduling problem of an animal feeds factory, which solve for the production and inventory levels for  individual items in future periods.</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, 1979</note>
  <subject authority="lcsh">
    <topic>Production planning</topic>
    <topic>Mathematical models</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. IE-79-13</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=B22311</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B22311</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">190698</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260817173414.0</recordChangeDate>
  </recordInfo>
</mods>
