Skip to main content
Book Chapter

Complexity Classification of Deterministic Scheduling Problems

  • Pinedo M
Springer US, (2012), 603-606
DOI: 10.1007/978-1-4614-2361-4_25
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Pinedo, M. L. (2012). Complexity Classification of Deterministic Scheduling Problems. In Scheduling (pp. 603–606). Springer US. https://doi.org/10.1007/978-1-4614-2361-4_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free