Apportionment methods and the Liu-Layland problem
From MaRDI portal
Publication:954936
DOI10.1016/j.ejor.2007.11.007zbMath1168.90447MaRDI QIDQ954936
Joanna Józefowska, Łukasz Józefowski, Wiesław X. Kubiak
Publication date: 18 November 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.007
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- Unnamed Item
- Liu and Layland's schedulability test revisited
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- The Chairman assignment problem
- A Class of New Methods for Congressional Apportionment
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
- Level Schedules for Mixed-Model, Just-in-Time Processes
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem