A hybrid algorithm for the single-machine total tardiness problem
From MaRDI portal
Recommendations
- Minimizing total tardiness on a single machine using ant colony optimization
- A novel hybrid algorithm for minimizing total weighted tardiness cost
- A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
- An enhanced genetic algorithm for the single machine total weighted tardiness problem
- A tabu search algorithm for the single machine total weighted tardiness problem
Cites work
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A decomposition algorithm for the single machine total tardiness problem
- A special case of the single-machine total tardiness problem is NP-hard
- Algorithmic paradoxes of the single-machine total tardiness problem
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing total tardiness on a single machine using ant colony optimization
- On decomposition of the total tardiness problem
- Solution of the NP-hard total tardiness minimization problem in scheduling theory
- Solution of the single machine total tardiness problem
Cited in
(9)- A novel hybrid algorithm for minimizing total weighted tardiness cost
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- The single-machine total tardiness scheduling problem: review and extensions
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
- Minimizing total tardiness on a single machine using ant colony optimization
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
This page was built for publication: A hybrid algorithm for the single-machine total tardiness problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954025)