Polynomial complete scheduling problems

Jeffrey David Ullman ยท 1973

We show that the problem of finding an optimal schedule for a set of jobs is polynomial complete even in the following two restricted cases.

Cited by 83 works. doi:10.1145/800009.808055

Authors

References