Publication Type:

Journal Article

Source:

IOP Conference Series: Materials Science and Engineering, IOP Publishing, Volume 310, Number 1, p.012143 (2018)

URL:

http://iopscience.iop.org/article/10.1088/1757-899X/310/1/012143

Abstract:

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.

Cite this Research Publication

K. Ramesh Kumar and Rajendran, C., “A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan”, IOP Conference Series: Materials Science and Engineering, vol. 310, p. 012143, 2018.