We consider a project scheduling problem with the objective being a piecewise-linear, convex (possibly, non-monotone) function of the job durations as well as of job start/finish times. A version of ‘out-of-kilter’ algorithm of pseudo-linear complexity to handle this problem is provided.