Ant Colonized and Taguchi Parallel Scheduliing with Sequence Independent Setup Time
G.Geetha1, T.Hemamalini2

1G.Geetha, Research Scholar, Department of Mathematics, Government Arts College,Coimbatore.
2Dr T.Hemamalini, Assistant professor, Department of Mathematics, Government Arts College,Coimbatore.
Manuscript received on January 23, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 3663-3671 | Volume-9 Issue-3, February 2020. | Retrieval Number:  C5904029320/2020©BEIESP | DOI: 10.35940/ijeat.C5904.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: 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.
Keywords: Job Shop, Parallel Machine, Scheduling, Ant Colonized, Taguchi, Processing time, Setup time