On decomposition of the total tardiness problem

https://doi.org/10.1016/0167-6377(95)00027-HGet rights and content

Abstract

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.

References (5)

There are more references available in the full text version of this article.

Cited by (0)

Supported by National Natural Science Foundation of China.

View full text