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.

Authors

Katsuto Nakajima

This author has not been identified. Look up 'Katsuto Nakajima' in Google

S. Louis Hakimi

This author has not been identified. Look up 'S. Louis Hakimi' in Google

Jan Karel Lenstra

This author has not been identified. Look up 'Jan Karel Lenstra' in Google