Opposition based genetic optimization algorithm with Cauchy mutation for job shop scheduling problem

In manufacturing industry, job shop scheduling (JSS) is predominant to improve productivity. The major goal of proposed work is to shorten the make span time. The performance of four optimizations techniques namely genetic algorithm optimization (GA), particle swarm optimization (PSO), opposition ba...

Full description

Saved in:
Bibliographic Details
Published inMaterials today : proceedings Vol. 72; pp. 3006 - 3011
Main Authors Anil Kumar, K.R., Dhas, Edwin Raja
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 2023
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In manufacturing industry, job shop scheduling (JSS) is predominant to improve productivity. The major goal of proposed work is to shorten the make span time. The performance of four optimizations techniques namely genetic algorithm optimization (GA), particle swarm optimization (PSO), opposition based particle swarm optimization with Cauchy distribution (OPSO CD) and opposition based genetic optimization algorithm with Cauchy distribution (OGA CD) are analysed to find the best make span reduction method. To determine the best effective optimization approach for solving JSSP, a comparison analysis of different optimization techniques was done. In comparison to other JSSP algorithms, the results demonstrate that OGA CD has the shortest make span time.
ISSN:2214-7853
2214-7853
DOI:10.1016/j.matpr.2022.08.263