Journal article Open Access

Ant Colonized and Taguchi Parallel Scheduliing with Sequence Independent Setup Time

G.Geetha; T.Hemamalini

MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="">
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Job Shop, Parallel Machine, Scheduling, Ant Colonized, Taguchi, Processing time, Setup time</subfield>
  <controlfield tag="005">20211023134843.0</controlfield>
  <controlfield tag="001">5593993</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Assistant professor, Department of Mathematics,  Government Arts College,Coimbatore-18.</subfield>
    <subfield code="a">T.Hemamalini</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Publisher</subfield>
    <subfield code="4">spn</subfield>
    <subfield code="a">Blue Eyes Intelligence Engineering  &amp; Sciences Publication(BEIESP)</subfield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">496876</subfield>
    <subfield code="z">md5:8ccc8802cff9c53a18aa815554298116</subfield>
    <subfield code="u"></subfield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2020-02-29</subfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o"></subfield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="c">3663-3671</subfield>
    <subfield code="n">3</subfield>
    <subfield code="p">International Journal of Engineering and Advanced Technology (IJEAT)</subfield>
    <subfield code="v">9</subfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Research Scholar, Department of Mathematics,  Government Arts College,Coimbatore-18.</subfield>
    <subfield code="a">G.Geetha</subfield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Ant Colonized and Taguchi Parallel Scheduliing  with Sequence Independent Setup Time</subfield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u"></subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2"></subfield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">ISSN</subfield>
    <subfield code="0">(issn)2249-8958</subfield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">Retrieval Number</subfield>
    <subfield code="0">(handle)C5904029320/2020©BEIESP</subfield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;The Job Shop Parallel Machine Scheduling (JSPMS) is a hybrid production system, and hence has received significant attention in the past few years. The JSPMS problem is a rationalization of the traditional job shop scheduling problem in computer science and operation research that permits to process operations on single machine out of a set of possible parallel machines. To maximize the job completion rate and minimize job completion time, a hybrid production system is necessary. With this objective, a novel meta-heuristic method is designed. This paper develops a scheduling method called, Ant Colonized and Taguchi Parallel Operation Scheduling (ACTPOS), for JSPMS, aimed to minimize job completion time and maximize job completion rate. The design of AC-TPOS method involves two different models, namely, Ant Colonized Parallel Machine Selection (ACPMS) model and Taguchi Parallel Operation Scheduling (TPOS) model. In ACPMS model, optimal selection of machine is done via operation being processed by parallel machines using local pheromone updating rule concentrating on the makespan time. In addition, the processing time and sequence-independent setup time are considered. Next, in TPOS model, optimal scheduling of operation is performed using Taguchi method concentrating on the makespan rate. Finally, the test results first show that our algorithm outperforms existing methods in terms of job completion rate, job completion time and computational complexity involved in scheduling operations.&lt;/p&gt;</subfield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">issn</subfield>
    <subfield code="i">isCitedBy</subfield>
    <subfield code="a">2249-8958</subfield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.35940/ijeat.C5904.029320</subfield>
    <subfield code="2">doi</subfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
Views 45
Downloads 16
Data volume 8.0 MB
Unique views 42
Unique downloads 16


Cite as