A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags

Positive and negative time-lags are general timing restrictions between the starting times of jobs which have been introduced by Roy in connection with the Metra Potential Method. They allow the consideration of postive and negative time-lags between the starting times of jobs. It is shown that complex scheduling problems like general shop problems, with multi-processor tasks, problems with multi-purpose machines, and problems with changeover times can be reduced to single-machine problems with positive and negative time-lags between jobs. Furthermore, a branch and bound algorithm is developed for solving such single-machine scheduling problems. The reductions can be used to construct test problems for this algorithm. Computational results for randomly generated single-machine problems and for shop scheduling problems (without time-lags) are reported.