Article contents
The complexity of short schedulesfor uet bipartite graphs
Published online by Cambridge University Press: 15 August 2002
Abstract
We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 1999
- 3
- Cited by