Login / Signup
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.
Katsuto Nakajima
S. Louis Hakimi
Jan Karel Lenstra
Published in:
SIAM J. Comput. (1982)
Keyphrases
</>
parallel machines
scheduling problem
fixed number
computational complexity
scheduling algorithm
round robin
worst case
resource allocation
identical machines
identical parallel machines
manufacturing cell
information systems
knowledge base
decision problems