Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines

Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra. Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. SIAM Journal on Computing, 11(3):512-520, 1982.

Abstract

Abstract is missing.