z-logo
open-access-imgOpen Access
A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan
Author(s) -
K. Rameshkumar,
Chandrasekharan Rajendran
Publication year - 2018
Publication title -
iop conference series materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/310/1/012143
Subject(s) - job shop scheduling , particle swarm optimization , benchmark (surveying) , mathematical optimization , computer science , schedule , variable neighborhood search , flow shop scheduling , job shop , algorithm , scheduling (production processes) , metaheuristic , mathematics , geodesy , geography , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom