Abstract
In this note a procedure is given for shortening the duration of a project al low cost. The procedure allows de-shortening of activities which may have been shortened initially and they happen to be exclusively in the path which has been shortened excessively. An example has been solved to illustrate the algorithm.