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 APA Style APA-ALL Style AAA 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). In Stichting Mathematisch Centrum. Mathematische Besliskunde (BW 131/80). Stichting Mathematisch Centrum.

Publication