New computational results for the discrete time/cost trade-off problem with time-switch constraints

In this paper, we propose a new branch-and-bound algorithm which outperforms the previous one by Vanhoucke et al. [J. Operat. Res. Soc. 53 (2002) 1]. The procedure makes use of a lower bound calculation for the discrete time/cost trade-off problem (without time-switch constraints). The procedure has been coded in Visual C++, version 6.0 under Windows 2000 and has been validated on a randomly generated problem set.