Name
Abstract | ||
|---|---|---|
This paper deals with the problem of scheduling $$n_\\mathrm{A}$$nA malleable and $$n_\\mathrm{B}$$nB non-malleable jobs to be executed together on two parallel identical machines to minimize mean flow time. We propose a set of dominant schedules for this problem, and a dynamic programming algorithm that finds an optimal schedule in this dominant set in time $$O(n_\\mathrm{A}^2n_\\mathrm{B})$$O(nA2nB). |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10951-013-0341-1 | Journal of Scheduling |
Keywords | Field | DocType |
Scheduling,Mean flow time,Preemptable jobs | Dynamic programming,Mathematical optimization,Mean flow,Scheduling (computing),Computer science,Real-time computing,Schedule | Journal |
Volume | Issue | ISSN |
18 | 4 | 1094-6136 |
Citations | PageRank | References |
2 | 0.38 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| yann hendel | 1 | 2 | 0.38 |
| Wieslaw Kubiak | 2 | 540 | 62.61 |
| Denis Trystram | 3 | 1120 | 160.57 |