The discrete time-cost trade off problem with irregular starting time costs

Abstract

In this chapter we review the literature on the discrete time-cost tradeoff problem (DTCTP). We then present the four integer programming formulations of a version of DTCTP with irregular starting time costs from Szmerekovsky and Venkateshan (Comp and Oper Res 39(7):1402-1410, 2012). Specifically the problem is an irregular costs project scheduling problem with time-cost tradeoffs. The empirical test performed in Szmerekovsky and Venkateshan (Comp and Oper Res 39(7):1402-1410, 2012) are updated using the current version of CPLEX and similar results are found being driven by a reduced number of binary variables, a tighter linear programming relaxation, and the sparsity and embedded network structure of the constraint matrix.