| Article ID: | iaor19981175 |
| Country: | Netherlands |
| Volume: | 19 |
| Issue: | 5 |
| Start Page Number: | 243 |
| End Page Number: | 250 |
| Publication Date: | Nov 1996 |
| Journal: | Operations Research Letters |
| Authors: | Szwarc Wlodzimierz, Mukhopadhyay Samar K. |
The paper deals with the single machine total tardiness problem. It develops a new decomposition rule and presents a special and very fast branch and bound algorithm based on pure decomposition. This algorithm is tested on 2400 problems whose sizes vary from 100 to 150 jobs.