Complexity of scheduling tasks with time-dependent execution times☆
References (7)
- J. Berger, Private...
- et al.
Complexity of scheduling parallel task systems
SIAM J. Discrete Math.
(1989) - et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
(1979)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
Research supported in part by the ONR grant N00014-91-J-1383 and in part by a grant from Texas Instruments, Inc.
- ∗∗∗
On leave from Department of Mathematics, Sichuan University, Chengdu, 610064, China.
Copyright © 1993 Published by Elsevier B.V.