One-machine generalized precedence constrained scheduling problems (Q1342279): Difference between revisions

The authors investigate one-machine scheduling problems subject to generalized precedence constraints. These constraints specify that for the time between the end of some job and the beginning of another job nonnegative lower and upper bounds are given. The objective is to minimize makespan. For some special cases of the introduced precedence relations complexity investigations are carried out.