A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

International Conference on Advances in Materials and Manufacturing Applications 2017

Rameshkumar, K.^1 ; Rajendran, C.^2

Department of Mechanical Engineering, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Amrita University, Bangalore

560035, India^1

Department of Management Studies, Indian Institute of Technology Madras, Chennai

600036, India^2

关键词: Active schedules;    Bench-mark problems;    Construction methodology;    Hybrid particles;    Job shop;    Job shop scheduling problems;    PSO algorithms;    Variable neighborhood search;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/310/1/012143/pdf
DOI  :  10.1088/1757-899X/310/1/012143

来源: IOP

【 摘 要 】

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.