The NP-completeness of the n/m/parallel/Cmaxpreemptive due-date scheduling problem

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)

Fingerprint

Dive into the research topics of 'The NP-completeness of the n/m/parallel/Cmaxpreemptive due-date scheduling problem'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics