Name
Abstract | ||
|---|---|---|
In this paper we formally introduce the distinction between strong and weak precedence relation in scheduling for the case of trees. We demonstrate that this distinction in precedence relation for trees (as demonstrated in earlier work for chains) is a proper one in the sense that some problems are solvable in polynomial time if weak tree relation is assumed and are NP-hard in the case of strong tree relations. For some other problems, both weak tree and strong tree relations are NP-hard, and for yet other problems both weak and strong tree relations are polynomially solvable. Since the distinction between strong and weak tree precedence was not clearly recognized in the past, this work establishes the existence of new problem categories in scheduling. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0020-0190(99)00103-9 | Information Processing Letters |
Keywords | Field | DocType |
Scheduling,Tree precedence relation,Computational complexity | Discrete mathematics,Scheduling (computing),Time complexity,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
71 | 3-4 | 0020-0190 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Moshe Dror | 1 | 574 | 64.77 |
| Wieslaw Kubiak | 2 | 540 | 62.61 |
| Joseph Y. -T. Leung | 3 | 2403 | 400.82 |