External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on