Name
Title | ||
|---|---|---|
A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times |
Abstract | ||
|---|---|---|
In this paper we present a new Discrete Particle Swarm Optimization (DPSO) approach to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup times. Differently from previous approaches the proposed DPSO uses a discrete model both for particle position and velocity and a coherent sequence metric. We tested the proposed DPSO mainly over a benchmark originally proposed by Cicirello in 2003 and available online. The results obtained show the competitiveness of our DPSO, which is able to outperform the best known results for the benchmark. In addition, we also tested the DPSO on a set of benchmark instances from ORLIB for the single machine total weighted tardiness problem, and we analysed the role of the DPSO swarm intelligence mechanisms as well as the local search intensification phase included in the algorithm. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejor.2007.10.044 | European Journal of Operational Research |
Keywords | Field | DocType |
Metaheuristics,Particle swarm optimization,Scheduling | Particle swarm optimization,Mathematical optimization,Job shop scheduling,Tardiness,Evolutionary algorithm,Swarm intelligence,Algorithm,Combinatorial optimization,Local search (optimization),Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
193 | 1 | 0377-2217 |
Citations | PageRank | References |
50 | 1.48 | 21 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Davide Anghinolfi | 1 | 141 | 11.81 |
| Massimo Paolucci | 2 | 4573 | 423.28 |