Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
From MaRDI portal
Publication:6134062
DOI10.1007/978-3-031-35305-5_15zbMath1528.90289MaRDI QIDQ6134062
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
- A tabu search algorithm for the single machine total weighted tardiness problem
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- The use of dynamic programming in genetic algorithms for permutation problems
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- The algebra of genetic algorithms
- A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- On complexity of optimal recombination for flowshop scheduling problems
- Minimizing Total Tardiness on One Machine is NP-Hard
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
This page was built for publication: Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem