<?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>02373nam a2200265 a 4500</leader>
  <controlfield tag="001">vtls000040669</controlfield>
  <controlfield tag="003">KUKTEM</controlfield>
  <controlfield tag="005">20251114204407.0</controlfield>
  <controlfield tag="008">090722t2008    my a   f m    000 0 eng|d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0005553(Local)</subfield>
  </datafield>
  <datafield tag="039" ind1=" " ind2="9">
    <subfield code="a">201905161123</subfield>
    <subfield code="b">hanafiah</subfield>
    <subfield code="c">201107132156</subfield>
    <subfield code="d">VLOAD</subfield>
    <subfield code="c">200908141650</subfield>
    <subfield code="d">VLOAD</subfield>
    <subfield code="c">200908141631</subfield>
    <subfield code="d">VLOAD</subfield>
    <subfield code="y">200907221130</subfield>
    <subfield code="z">ida84</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMP</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">T56.24 .F33 2008 rs Bc.</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Mohd Fadil Md Sairi</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Application of genetic algorithm methods to optimize flowshop sequencing problem /</subfield>
    <subfield code="c">Mohd Fadil Md Sairi</subfield>
  </datafield>
  <datafield tag="246" ind1="3" ind2=" ">
    <subfield code="a">Application of genetic algorithm methods to optimize flowshop sequencing problem</subfield>
    <subfield code="h">[electronic resource]</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMP,</subfield>
    <subfield code="c">2008</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">54 p. :</subfield>
    <subfield code="b">ill. (some col.) ;</subfield>
    <subfield code="c">30 cm. +</subfield>
    <subfield code="e">1 computer disc</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Project paper (Bachelor of Mechanical Engineering) -- Universiti Malaysia Pahang - 2008</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">Application of genetic algorithm method to optimize flow shop sequencing problem as the title of this project is the study about the method used in order to optimize flow shop sequencing problem. Genetic algorithm method was one of the methods that were widely used in solving optimization problem. Genetic algorithm method is methods that follow the natural concept. Flow shop sequencing problem or also known as assembly line problem that normally faced by production company. This project will define the application of genetic algorithm method in solving flow shop sequencing problem in details and evaluate the strength and weakness of genetic algorithm method in order to optimize the optimization problem. This project will focusing on the method used to solve an optimization problem, the limitation of the method used and the results of solving flow shop sequencing problem using genetic algorithm method. At the end of this project, we can see the performance of genetic algorithm method in solving flow shop sequencing problem and types of flow shop sequencing problems that can be solve through genetic algorithm method. Limitation of genetic algorithm method also can be shown at the end of this project.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Industrial engineering</subfield>
    <subfield code="x">Mathematical models</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Genetic algoritms</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Mathematical optimization</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">1</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2019-09-04</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">T56.24 .F33 2008 rs Bc.</subfield>
    <subfield code="p">0000038132</subfield>
    <subfield code="r">2019-09-04 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2019-09-04</subfield>
    <subfield code="y">PSM</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">1</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2019-09-04</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD 3419 | T56.24 .F33 2008 rs Bc.</subfield>
    <subfield code="p">0000038133</subfield>
    <subfield code="r">2019-09-04 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2019-09-04</subfield>
    <subfield code="y">PSM</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VIRTUA40</subfield>
    <subfield code="c">1286</subfield>
    <subfield code="d">1292</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VTLSSORT0080*0200*0400*0900*1000*2450*2460*2600*3000*5020*5200*6500*6501*6502*9992</subfield>
  </datafield>
</record>
