Apportionment methods and the Liu-Layland problem

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.

MoreLess

Year of publication:	2009
Authors:	Józefowska, Joanna ; Józefowski, Lukasz ; Kubiak, Wieslaw
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 193.2009, 3, p. 857-864
Publisher:	Elsevier
Keywords:	Scheduling Just-in-time scheduling Apportionment theory Divisor methods Hard real-time systems

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005253070