Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem

DOI10.1080/00207540600620849zbMath1114.90391OpenAlexW2009331272MaRDI QIDQ3430248

Mehmet Sevkli, Yun-Chia Liang, M. Fatih Tasgetiren, Gunes Gencyilmaz

Publication date: 21 March 2007

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600620849

zbMATH Keywords

single machine scheduling problemevolutionary algorithmsdifferential evolutionparticle swarm optimizationtotal weighted tardiness

Mathematics Subject Classification ID

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

Related Items

A particle swarm optimisation algorithm for multi-plant assembly sequence planning with integrated assembly sequence planning and plant assignment ⋮ Hidden Markov models training by a particle swarm optimization algorithm ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem ⋮ An enhanced grasshopper optimization algorithm to the Bin packing problem ⋮ A discrete particle swarm optimization for lot-streaming flowshop scheduling problem ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ 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 ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM ⋮ Optimal rendezvous points selection to reliably acquire data from wireless sensor networks using mobile sink ⋮ A population-based variable neighborhood search for the single machine total weighted tardiness problem ⋮ Interval-indexed formulation based heuristics for single machine total weighted tardiness problem ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ Job shop scheduling optimization through multiple independent particle swarms ⋮ Differential Evolution for Permutation—Based Combinatorial Problems ⋮ Discrete/Binary Approach

Uses Software

• OR-Library

Cites Work

• A branch and bound algorithm to minimize total weighted tardiness on a single processor
• A controlled search simulated annealing method for the single machine weighted tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Variable neighborhood search
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Ant colony optimization with global pheromone evaluation for scheduling a single machine
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Scheduling with Deadlines and Loss Functions
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• A Dynamic Programming Approach to Sequencing Problems
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Minimizing Total Costs in One-Machine Scheduling
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution