Some remarks on the decomposition properties of the single machine total tardiness problem
From MaRDI portal
Publication:856256
DOI10.1016/J.EJOR.2005.09.037zbMATH Open1110.90043OpenAlexW2044416289MaRDI QIDQ856256FDOQ856256
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
Cites Work
- Title not available (Why is that?)
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- A decomposition algorithm for the single machine total tardiness problem
- On decomposition of the total tardiness problem
- Algorithmic paradoxes of the single-machine total tardiness problem
- Solution of the single machine total tardiness problem
Cited In (7)
- A new decomposition approach for the single machine total tardiness scheduling problem
- New insights on the single machine total tardiness problem
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- Decomposition of the single machine total tardiness problem
- The single-machine total tardiness scheduling problem: review and extensions
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- On decomposition of the total tardiness problem
Recommendations
- On decomposition of the total tardiness problem 👍 👎
- Decomposition of the single machine total tardiness problem 👍 👎
- A new decomposition approach for the single machine total tardiness scheduling problem 👍 👎
- Dynamic programming and decomposition approaches for the single machine total tardiness problem 👍 👎
- Solution 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856256)
