Apportionment methods and the Liu-Layland problem

DOI10.1016/J.EJOR.2007.11.007MaRDI QIDQ954936zbMATH OpenOpenAlexFDO

Authors Joanna Józefowska, Łukasz Józefowski, Wieslaw 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

zbMATH Keywords

schedulingjust-in-time schedulinghard real-time systemsdivisor methodsapportionment theory

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
• Linear-time algorithms for proportional apportionment
• New apportionment methods and their quota property
• ON A PARAMETRIC DIVISOR METHOD FOR THE APPORTIONMENT PROBLEM
• An Algorithm for the Equipollent Resource Allocation Problem

Cites work

• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• A Class of New Methods for Congressional Apportionment
• A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Liu and Layland's schedulability test revisited
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
• The Chairman assignment problem

Cited in

(3)

• scientific article; zbMATH DE number 5726465 (Why is no real title available?)
• Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
• Just-in-time scheduling in modern mass production environment

This page was built for publication: Apportionment methods and the Liu-Layland problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954936)