<?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>03561nam a2200337 i 4500</leader>
  <controlfield tag="003">MY-KuUP</controlfield>
  <controlfield tag="005">20251231121019.0</controlfield>
  <controlfield tag="006">t||||fr|||| 000 0 </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">251231t20252025my a|||fr|||| 000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0010197 (Local)</subfield>
    <subfield code="q">Hardback</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMPSA</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">UMPSA</subfield>
    <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">FTKPM .W37 2025 r Thesis</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Wasif Ullah,</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Teaching learning-based optimization for cost-oriented hybrid flow shop scheduling /</subfield>
    <subfield code="c">Wasif Ullah</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMPSA,</subfield>
    <subfield code="c">2025</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="c">&#xA9; 2025</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xii, 125 pages :</subfield>
    <subfield code="b">illustrations (some color) ;</subfield>
    <subfield code="c">30 cm. +</subfield>
    <subfield code="e">1 CD-COM</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="2">rdacontent</subfield>
    <subfield code="a">text</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="2">rdamedia</subfield>
    <subfield code="a">unmediated</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="2">rdacarrier</subfield>
    <subfield code="a">volume</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="2">rda</subfield>
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Faculty of Manufacturing and Mechatronic Engineering Technology</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Thesis (Master of Science) -- Universiti Malaysia Pahang &#x2013; 2025</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">Production scheduling is a strategic process of organizing the execution of jobs on available resources to optimize certain optimization objectives. One of the important scheduling problem is the cost-oriented hybrid flow shop (CHFS) scheduling problem, which involves optimizing the scheduling of jobs across multiple stages to minimize the scheduling-related costs. Despite the significance of cost optimization in CHFS scheduling, there is a lack of comprehensive studies that address all major cost components using efficient optimization algorithms. For this purpose, a comprehensive cost model was developed that includes four cost elements: labor costs, machine energy consumption costs, preventive maintenance costs, and late penalty costs. Then a Greedy-assisted Teaching Learning-Based Optimization (GTLBO) algorithm was proposed to optimize the developed CHFS model. In GTLBO algorithm the initialization process was hybridized with Greedy algorithm, where 10% of initial population was generated by Greedy algorithm, while 90% randomly generated as usual. Afterward, a computational experiment was conducted to evaluate the performance of GTLBO algorithm by choosing certain comparative algorithms. The experiment utilized a dataset of 12 benchmark test problems defined by Carlier and Neron and was conducted using MATLAB version 2022b. The Wilcoxon rank-sum test confirmed statistically significant improvements (p value &lt; 0.05) in most scenarios. The experiment and Wilcoxon test revealed that GTLBO outperformed other algorithms in optimizing the CHFS problems. For the practical validation of the CHFS model and the GTLBO algorithm, two real-case study problems were analyzed by comparing the optimized schedule costs obtained using GTLBO with the costs of the original schedules. In case study 1, the proposed method reduced the total scheduling cost from RM 53,314.00 to RM 50,854.88, achieving a cost reduction of approximately 4.6%. In case study 2, the cost was reduced from RM 214.35 to RM 208.92, resulting in a 2.5% improvement. This research can help the manufacturers with HFS scheduling setups struggling to minimize their production expenses. Future research directions include establishing multi-objective CHFS scheduling models and developing hybridized optimization algorithms to optimize these models.</subfield>
  </datafield>
  <datafield tag="610" ind1="2" ind2="0">
    <subfield code="a">Faculty of Manufacturing and Mechatronic Engineering Technology</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Universities and colleges</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Theses</subfield>
    <subfield code="x">Dissertations</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">1</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2025-12-31</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">FTKPM .W37 2025 r Thesis</subfield>
    <subfield code="p">T000003885</subfield>
    <subfield code="r">2025-12-31 12:10:33</subfield>
    <subfield code="w">2025-12-31</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">-2</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2025-12-31</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD13813</subfield>
    <subfield code="p">T000003886</subfield>
    <subfield code="r">2025-12-31 12:15:04</subfield>
    <subfield code="w">2025-12-31</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">103816</subfield>
    <subfield code="d">103822</subfield>
  </datafield>
</record>
