Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem