<?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>An </nonSort>
    <title>application of the linear programming technique in one- and two-dimensional stock cutting problems</title>
  </titleInfo>
  <name type="personal">
    <namePart>Raza, Sohail</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Wireland, Martin</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Jearkjirm, Vithool</namePart>
    <role>
      <roleTerm type="text">Co-Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Worsak Kanok-Nukulchai</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Government of Switzerland</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>1983</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>v, 92 p.</extent>
  </physicalDescription>
  <abstract>Optimization in the use of construction resources on a  project is always worthwhile . Using a minimal quantity of  the available mate ria ls to fulfil given set o f demand c an  r educe the construction cost considerably. The possibility  of cutting out the required sizes of one- and two-dimensional objects, using as little stock as possible, has been explored in this report.  The linear programming technique has been used as the  basic tool for optimization and the study is computer-oriented . An attempt has been made to keep the resulting patterns simple and practicable, even at the cost at a little relaxation in optimality.  The IBM package MPSX/MIP-370 h as been used to solve the  linear programming problems. For the two dimensional  problem, several types of arrangement o f the demand sizes have been tried on sample examples to heuristically find the  arrangement that gives the most economical results</abstract>
  <note>A thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1983</note>
  <subject authority="lcsh">
    <topic>Cutting</topic>
    <topic>Linear programming</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. ST-83-14</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=B21000</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B21000</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">040898</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260817162956.0</recordChangeDate>
  </recordInfo>
</mods>
