An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
Parallel processing: the Cm* experience
Parallel processing: the Cm* experience
The complexity of scheduling independent two-processor tasks on dedicated processors
Information Processing Letters
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
A linear time algorithm for edge coloring of binomial trees
Discrete Mathematics - Special issue: selected papers in honour of Paul Erdo&huml;s on the occasion of his 80th birthday
Edge-chromatic sum of trees and bounded cyclicity graphs
Information Processing Letters
Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.