Apportionment methods and the Liu-Layland problem

Joanna Józefowska,Lukasz Józefowski,Wieslaw Kubiak

European Journal of Operational Research（2009）

引用 6|浏览6

暂无评分

摘要

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.

查看译文

关键词

Scheduling,Just-in-time scheduling,Apportionment theory,Divisor methods,Hard real-time systems

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要