Resource-requirement minimization in relocation problems with precedence constraints

The relocation problem is a generalized resource-constrained job scheduling problem in the aspect that the amount of resources returned at the completion of a job is not necessarily equal to that demanded. The authors propose fundamental properties of the basic relocation problem. Also, they consider a variant RPPC into which precedence constraints are introduced. They show that RPPC is NP-complete, even if the precedence graphs are bi-partite. Furthermore, efficient algorithms are presented to solve some polynomially solvable subproblems.<
>