On decomposition of the total tardiness problem
Authors:
- S. ChangSCS. Chang
- Q. LuQLQ. Lu
- G. TangGTG. Tang
- W. YuWYW. Yu
- 1 June 1995
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 17 (5) , 221-229
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- A decomposition algorithm for the single machine total tardiness problemOperations Research Letters, 1982
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969