Apportionment methods and the Liu-Layland problem
AbstractThe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 193 (2009)
Issue (Month): 3 (March)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Scheduling Just-in-time scheduling Apportionment theory Divisor methods Hard real-time systems;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- George Steiner & Scott Yeomans, 1993. "Level Schedules for Mixed-Model, Just-in-Time Processes," Management Science, INFORMS, vol. 39(6), pages 728-735, June.
- John Miltenburg, 1989. "Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems," Management Science, INFORMS, vol. 35(2), pages 192-207, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.