A new formulation for scheduling unrelated processor under precedence constraints

We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued

A new formulation for scheduling unrelated processor under precedence constraints

We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables variables and does not require that the processing times be integer valued.331879