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.
@article{NakajimaHL82,
title = {Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines},
author = {Katsuto Nakajima and S. Louis Hakimi and Jan Karel Lenstra},
year = {1982},
researchr = {https://researchr.org/publication/NakajimaHL82},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {11},
number = {3},
pages = {512-520},
}