| Article ID: | iaor1997288 |
| Country: | Netherlands |
| Volume: | 17 |
| Issue: | 5 |
| Start Page Number: | 221 |
| End Page Number: | 229 |
| Publication Date: | Jun 1995 |
| Journal: | Operations Research Letters |
| Authors: | Yu W., Chang S., Lu Q., Tang G. |
As an improvement of the famous Lawler Decomposition Theorme 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 jore efficient. In this paper, more conditions on the leftmost decomposition position are proved. Additional computational tests are described.