Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
From MaRDI portal
Publication:6134062
DOI10.1007/978-3-031-35305-5_15zbMATH Open1528.90289MaRDI QIDQ6134062FDOQ6134062
Authors: Yulia Zakharova
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Recommendations
- A novel hybrid algorithm for minimizing total weighted tardiness cost
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
- An enhanced genetic algorithm for the single machine total weighted tardiness problem
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem
- A tabu search algorithm for the single machine total weighted tardiness problem
- The use of dynamic programming in genetic algorithms for permutation problems
- The algebra of genetic algorithms
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- On complexity of optimal recombination for flowshop scheduling problems
- A hybrid metaheuristic for the single-machine total weighted tardiness problem
- On complexity of optimal recombination for one scheduling problem with setup times
This page was built for publication: Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134062)