Article ID: | iaor2004183 |
Country: | Netherlands |
Volume: | 31 |
Issue: | 2 |
Start Page Number: | 142 |
End Page Number: | 148 |
Publication Date: | Mar 2003 |
Journal: | Operations Research Letters |
Authors: | Croce F. Della, T'kindt V. |
Keywords: | combinatorial analysis |
We consider the single machine dynamic total completion time scheduling problem. This problem is known to be NP-hard in the strong sense. The currently best available lower bound for the problem is known to be the optimal solution value of the corresponding preemptive problem which can be computed in