We consider a project scheduling problem where the precedence constraints graph is an out-tree. The processing times can be compressed by using additional resources, which causes cost and simultaneously reduces the processing times of jobs. The objective is to minimize the sum of total lateness...