On decomposition of the total tardiness problem
From MaRDI portal
Publication:1924615
DOI10.1016/0167-6377(95)00027-HzbMath0858.90072OpenAlexW2170188992MaRDI QIDQ1924615
Publication date: 20 October 1996
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(95)00027-h
Related Items
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 theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates ⋮ The proportionate flow shop total tardiness problem ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ A special case of the single-machine total tardiness problem is NP-hard ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ A hybrid algorithm for the single-machine total tardiness problem ⋮ A faster fully polynomial approximation scheme for the single-machine total tardiness problem ⋮ Algorithmic paradoxes of the single-machine total tardiness problem ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ Solution of the single machine total tardiness problem
Cites Work
