The Aamodt and Kjus problem

Abstract

We conjecture that an interesting special case of the known NP-complete problem, Multiprocessor Scheduling (MPS), is well inside P. We present a number of results that supports the conjecture. We also give some empirical results that strengthen our beliefs concerning the conjecture.