On decomposition of the total tardiness problem

S. Chang, Q. Lu, G. Tang, Wenci Yu

Research output: Contribution to journalArticleAcademicpeer-review

31 Citations (Scopus)
2 Downloads (Pure)


As an improvement of the famous Lawler Decomposition Theorem for the one-machine total tardiness problem, some conditions on decomposition positions are obtained by Potts and Wassenhove, and are used by them to make the decomposition algorithm more efficient. In this paper, more conditions on the leftmost decomposition position are proved. Additional computational tests are described.
Original languageEnglish
Pages (from-to)221-229
Number of pages9
JournalOperations Research Letters
Issue number5
Publication statusPublished - 1995


Dive into the research topics of 'On decomposition of the total tardiness problem'. Together they form a unique fingerprint.

Cite this