Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
From MaRDI portal
Publication:398925
DOI10.1007/s10951-013-0351-zzbMath1297.90061OpenAlexW2021659413MaRDI QIDQ398925
Zhipeng Lü, Hongyun Xu, Cheng, T. C. Edwin
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0351-z
single-machine schedulingiterated local searchtotal weighted tardinessblock movesequence dependent setup
Related Items
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ MRI appointment scheduling with uncertain examination time ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A tabu search algorithm for the single machine total weighted tardiness problem
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Adaptive tabu search for course timetabling
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- Enhancing stochastic search performance by value-biased randomization of heuristics
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- A memetic algorithm for the total tardiness single machine scheduling problem
