Complexity results for scheduling tasks in fixed intervals on two types of machines : (preprint)

Additional Metadata
Publisher	Stichting Mathematisch Centrum
Series	Stichting Mathematisch Centrum. Mathematische Besliskunde
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Nakajima, K., Hakimi, S. L., & Lenstra, J. K. (1980). Complexity results for scheduling tasks in fixed intervals on two types of machines : (preprint). Stichting Mathematisch Centrum. Mathematische Besliskunde. Stichting Mathematisch Centrum.

Publication