Lower bounds on precedence-constrained scheduling for parallel processors
References (14)
NP-complete scheduling problems
J. Comput. Systems Sci.
(1975)- et al.
Algorithms for total weighted completion time scheduling
Scheduling equal-length jobs on identical parallel machines, Research Report
(1998)- et al.
Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness
Math. Oper. Res.
(1977) - et al.
Scheduling independent tasks to reduce mean finishing time
Comm. ACM
(1974) - et al.
Optimal scheduling for two-processor systems
Acta Inform.
(1972) - et al.
Balance scheduling: Weighting branch tradeoffs in superblocks
There are more references available in the full text version of this article.
Cited by (3)
Scheduling of unrelated machines to minimize costs with precedence constraints based on amended DP algorithm
2011, Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and PracticeParallel scheduling for early completion
2004, Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Copyright © 2001 Elsevier Science B.V. All rights reserved.