A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times

DOI10.1016/J.EJOR.2007.10.044zbMath1152.90423OpenAlexW1993362995MaRDI 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

zbMATH Keywords

schedulingmetaheuristicsparticle swarm optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (21)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ A hybrid particle swarm optimization approach for the sequential ordering problem ⋮ Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Heuristic solution approaches for the cumulative capacitated vehicle routing problem ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ Prepositioning emergency earthquake response supplies: a new multi-objective particle swarm optimization algorithm ⋮ Probability mechanism based particle swarm optimization algorithm and its application in resource-constrained project scheduling problems ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study

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

This page was built for publication: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times