A two-level particle swarm optimisation algorithm on job-shop scheduling problems
Summary: The paper first presents an efficient PSO algorithm called GLN-PSO\(_{\text c}\). It is a variant of the standard PSO algorithm that requires a mapping procedure in order to solve a specific problem. Two mapping procedures are proposed in this paper for GLN-PSO\(_{\text c}\). The first mapping combined with GLN-PSO\(_{\text c}\) is a heuristics for JSP and is called JSP-PSO. The second mapping combined with GLN-PSO\(_{\text c}\) resulted in a parameter-tuning algorithm called PT-PSO. The combination of these two algorithms JSP-PSO and PT-PSO forms a two-level PSO. It is efficient and able to generate very good solutions on the benchmark instances.
- A two-level particle swarm optimisation algorithm for open-shop scheduling problem
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
- A particle swarm optimization algorithm for job-shop scheduling problem
- A hybrid particle swarm optimization algorithm for job-shop scheduling problem
- A particle swarm optimization-based algorithm for job-shop scheduling problems
- A two-level particle swarm optimisation algorithm for open-shop scheduling problem
- An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
- A PSO-based procedure for a bi-level multi-objective TOC-based job-shop scheduling problem
- Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach
- Bi-level multi-objective mathematical model for job-shop scheduling: the application of theory of constraints
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
This page was built for publication: A two-level particle swarm optimisation algorithm on job-shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013429)