Apportionment methods and the Liu-Layland problem (Q954936): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Note on the Relation between the Product Rate Variation (PRV) Problem and the Apportionment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liu and Layland's schedulability test revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Liu-Layland problem via bottleneck just-in-time sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level Schedules for Mixed-Model, Just-in-Time Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of New Methods for Congressional Apportionment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chairman assignment problem / rank
 
Normal rank

Latest revision as of 20:32, 28 June 2024

scientific article
Language Label Description Also known as
English
Apportionment methods and the Liu-Layland problem
scientific article

    Statements

    Apportionment methods and the Liu-Layland problem (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    0 references
    scheduling
    0 references
    just-in-time scheduling
    0 references
    apportionment theory
    0 references
    divisor methods
    0 references
    hard real-time systems
    0 references
    0 references