Scheduling with two non-unit task lengths is NP-complete (Not published)

Jan Elffers, Mathijs de Weerdt

Research output: Contribution to journal › Article › Scientific

Fingerprint

Dive into the research topics of 'Scheduling with two non-unit task lengths is NP-complete (Not published)'. Together they form a unique fingerprint.

INIS

Computer Science