×

zbMATH — the first resource for mathematics

A new formulation for scheduling unrelated processor under precedence constraints. (English) Zbl 0958.90046
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.

MSC:
90B35 Deterministic scheduling theory in operations research
PDF BibTeX XML Cite
Full Text: DOI EuDML