Performance Analysis of Opposition Based Particle Swarm Optimization with Cauchy Distribution in Minimizing Makespan Time in Job Shop Scheduling

In the contemporary circumstances, manual solving of job shop scheduling problem (JSSP) is quite time consuming and inaccurate. The main intention of this paper is to analyze the performance of various optimization techniques in JSSP in order to minimize makespan time. This paper aims to analyze fou...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of recent technology and engineering Vol. 8; no. 6; pp. 360 - 366
Main Authors R., Anil Kumar K., Dhas, Dr. Edwin Raja
Format Journal Article
LanguageEnglish
Published 30.03.2020
Online AccessGet full text

Cover

More Information
Summary:In the contemporary circumstances, manual solving of job shop scheduling problem (JSSP) is quite time consuming and inaccurate. The main intention of this paper is to analyze the performance of various optimization techniques in JSSP in order to minimize makespan time. This paper aims to analyze four optimization techniques viz, particle swarm optimization (PSO), genetic algorithm (GA), opposition based genetic algorithm(OGA) and opposition based particle swarm optimization with Cauchy distribution (OPSO CD) in addition to the existing optimization techniques applied in various research papers on combinatorial optimization problems viz., JSSP. A comparative study of these optimization techniques were conducted and analyzed to find out the most effective optimization technique on solving JSSP. Results show that OPSO CD is found to possess minimum makespan time in comparison with other algorithms for JSSP.
ISSN:2277-3878
2277-3878
DOI:10.35940/ijrte.D8524.038620