On the single machine total tardiness problem
From MaRDI portal
Recommendations
- Solution of the single machine total tardiness problem
- scientific article; zbMATH DE number 1076139
- Single machine total tardiness maximization problems: complexity and algorithms
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- The single-machine total tardiness scheduling problem: review and extensions
Cites work
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithmic paradoxes of the single-machine total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Solution of the single machine total tardiness problem
- The Total Tardiness Problem: Review and Extensions
Cited in
(14)- Single machine total tardiness maximization problems: complexity and algorithms
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- The single-machine absolute-deviation early-tardy problem with random completion times
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
- New insights on the single machine total tardiness problem
- The Single Machine Early/Tardy Problem
- Insights into two solution procedures for the single machine tardiness problem
- The Total Tardiness Problem: Review and Extensions
- Decomposition of the single machine total tardiness problem
- The single-machine total tardiness scheduling problem: review and extensions
- A tabu search algorithm for the single machine total weighted tardiness problem
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- Solution of the single machine total tardiness problem
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
This page was built for publication: On 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 Q1771373)