Some remarks on the decomposition properties of the single machine total tardiness problem

DOI10.1016/j.ejor.2005.09.037zbMath1110.90043OpenAlexW2044416289MaRDI QIDQ856256

Wlodzimierz Szwarc

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.037

zbMATH Keywords

decompositiontardinessdue dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A faster fully polynomial approximation scheme for the single-machine total tardiness problem ⋮ The single-machine total tardiness scheduling problem: review and extensions

Cites Work

• Unnamed Item
• Solution of the single machine total tardiness problem
• 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
• Algorithmic paradoxes of the single-machine total tardiness problem

This page was built for publication: Some remarks on the decomposition properties of the single machine total tardiness problem