Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints | IEEE Conference Publication | IEEE Xplore