A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
From MaRDI portal
Publication:2519079
DOI10.1016/j.ejor.2007.10.044zbMath1152.90423MaRDI QIDQ2519079
Davide Anghinolfi, Massimo Paolucci
Publication date: 22 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.044
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, A hybrid particle swarm optimization approach for the sequential ordering problem, A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Scheduling in a sequence dependent setup environment with genetic search
- Variable neighborhood search
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- Swarm intelligence in data mining.
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- Enhancing stochastic search performance by value-biased randomization of heuristics
- Minimizing Total Tardiness on One Machine is NP-Hard
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A memetic algorithm for the total tardiness single machine scheduling problem
