<?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>
    <title>Design of automated storage and retrieval systems using simulation modeling</title>
  </titleInfo>
  <name type="personal">
    <namePart>Wynn Khai Htay</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Pandey, P.C.</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Bohez, Erik L.J.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Nagarur, Nagendra N.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Belgium Government</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>1997</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>76 p.</extent>
  </physicalDescription>
  <abstract>The main purpose of this study is to find a optimal solution for a specific formulation of  the warehouse design by using SIMPLE++ simulation software for Thai Airways  International Cargo Terminal. In This formulation, three types of cost are considered:  costs associated construction and handling facilities costs, a shortage cost and storage  policy Cost. The design configuration with eight rows, 26 columns and six stacker aisles  are found the optimum in using three class-based assignment policy for this case.  Furthermore, this study calculate the framework of the dual command continuous travel  time model under class-based assignment. The model develop is for square in time system  and the ABC dtribution is combined into the mode as the inventory turnover function.  The evaluation of the continuous improvements of class-based assignment over random  storage policy with various turnover functions are also calculated. On the comparison of  the efficiency of the class-based assignment random assignment under dual command  cycle, the percentage improvements grow as the number of class increases. The first class  items occupy at least 25% of the storage rack is better to apply for a more general  representation in the continuous warehouse model. Finally, it is concluded that a three class assignment policy is adequate for a highly skew inventory. </abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of  Engineering, School of Advanced Technologies</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1997</note>
  <subject authority="lcsh">
    <topic>Warehouses</topic>
    <topic>Automation</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. ISE-97-18</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=B14345</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B14345</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">      </recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818090226.0</recordChangeDate>
  </recordInfo>
</mods>
