The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3899811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single batch processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordination mechanism for a scheduling game with parallel-batching machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of Local Search for Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-clairvoyant Scheduling Games / 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: Scheduling Independent Tasks on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for LPT Scheduling on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoffs in worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Nash equilibria for scheduling on restricted parallel links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank

Latest revision as of 01:14, 14 July 2024

scientific article
Language Label Description Also known as
English
The shortest first coordination mechanism for a scheduling game with parallel-batching machines
scientific article

    Statements

    The shortest first coordination mechanism for a scheduling game with parallel-batching machines (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2017
    0 references
    scheduling
    0 references
    game
    0 references
    coordination mechanism
    0 references
    Nash equilibrium
    0 references
    price of anarchy
    0 references
    0 references
    0 references
    0 references

    Identifiers