Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates (Q473611): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:21, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates |
scientific article |
Statements
Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates (English)
0 references
24 November 2014
0 references
Summary: We consider the NP-hard problem of minimizing makespan for \(n\) jobs on \(m\) unrelated parallel machines with release dates in this research. A heuristic and a very effective particle swarm optimization (PSO) algorithm have been proposed to tackle the problem. Two lower bounds have been proposed to serve as a basis for comparison for large problem instances. Computational results show that the proposed PSO is very accurate and that it outperforms the existing metaheuristic.
0 references
