Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling for electricity cost in a smart grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling for Electricity Cost in Smart Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-preemptive scheduling in a smart grid model and its implications on machine minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Nonpreemptive Scheduling in a Smart Grid Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for demand response management in smart grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for selfish and greedy load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa Claus Schedules Jobs on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph balancing: a special case of scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some special cases of the restricted assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graph balancing problems with restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the configuration-LP for scheduling on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for job scheduling with processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-valued case of makespan minimization with assignment constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing of Temporary Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line load balancing of temporary tasks revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank

Latest revision as of 17:54, 26 July 2024

scientific article; zbMATH DE number 7402290
Language Label Description Also known as
English
Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
scientific article; zbMATH DE number 7402290

    Statements

    Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2021
    0 references
    optimal online algorithm
    0 references
    restricted assignment
    0 references
    smart grid scheduling
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references