Algorithmic paradoxes of the single-machine total tardiness problem

Recommendations

Solution of the single machine total tardiness problem
Decomposition of the single machine total tardiness problem
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
On the Single-machine Scheduling Problem with Tardiness Penalties
scientific article; zbMATH DE number 1076139

Cites work

A decomposition algorithm for the single machine total tardiness problem
On decomposition of the total tardiness problem
One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
Solution of the single machine total tardiness problem

Cited in

(19)

The single-machine total tardiness scheduling problem: review and extensions
Distributionally robust single machine scheduling with the total tardiness criterion
On the single machine total tardiness problem
Scheduling a single machine to minimize a regular objective function under setup constraints
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
Finding the Pareto-optima for the total and maximum tardiness single machine problem
A special case of the single-machine total tardiness problem is NP-hard
\textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
Some remarks on the decomposition properties of the single machine total tardiness problem
A hybrid algorithm for the single-machine total tardiness problem

This page was built for publication: Algorithmic paradoxes of 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 Q5937433)