Name
Abstract | ||
|---|---|---|
The Liu–Layland periodic scheduling problem can be solved by the house monotone quota methods of apportionment. This paper shows that staying within the quota is necessary for any apportionment divisor method to solve this problem. As a consequence no divisor method, or equivalently no population monotone method, solves the Liu–Layland problem. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejor.2007.11.007 | European Journal of Operational Research |
Keywords | DocType | Volume |
Scheduling,Just-in-time scheduling,Apportionment theory,Divisor methods,Hard real-time systems | Journal | 193 |
Issue | ISSN | Citations |
3 | 0377-2217 | 1 |
PageRank | References | Authors |
0.39 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joanna Józefowska | 1 | 324 | 25.14 |
| Łukasz Józefowski | 2 | 3 | 0.79 |
| Wieslaw Kubiak | 3 | 540 | 62.61 |