Journal article Open Access

Ant Colonized and Taguchi Parallel Scheduliing with Sequence Independent Setup Time

G.Geetha; T.Hemamalini


Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:contributor>Blue Eyes Intelligence Engineering  &amp; Sciences Publication(BEIESP)</dc:contributor>
  <dc:creator>G.Geetha</dc:creator>
  <dc:creator>T.Hemamalini</dc:creator>
  <dc:date>2020-02-29</dc:date>
  <dc:description>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.</dc:description>
  <dc:identifier>https://zenodo.org/record/5593993</dc:identifier>
  <dc:identifier>10.35940/ijeat.C5904.029320</dc:identifier>
  <dc:identifier>oai:zenodo.org:5593993</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>issn:2249-8958</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:source>International Journal of Engineering and Advanced Technology (IJEAT) 9(3) 3663-3671</dc:source>
  <dc:subject>Job Shop, Parallel Machine, Scheduling, Ant Colonized, Taguchi, Processing time, Setup time</dc:subject>
  <dc:subject>ISSN</dc:subject>
  <dc:subject>Retrieval Number</dc:subject>
  <dc:title>Ant Colonized and Taguchi Parallel Scheduliing  with Sequence Independent Setup Time</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>
45
16
views
downloads
Views 45
Downloads 16
Data volume 8.0 MB
Unique views 42
Unique downloads 16

Share

Cite as