Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal Coordination Mechanisms for Unrelated Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient coordination mechanisms for unrelated machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parallel Machine Scheduling Problems by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner product spaces for MinSum coordination mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism Design for Decentralized Online Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy jobs for \(m\) parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Anarchy for Minsum Related Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on parallel processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Anarchy in Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank

Revision as of 01:06, 29 July 2024

scientific article
Language Label Description Also known as
English
Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
scientific article

    Statements

    Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (English)
    0 references
    0 references
    0 references
    20 May 2022
    0 references
    scheduling
    0 references
    distributed scheduling
    0 references
    price of anarchy
    0 references
    coordination mechanisms
    0 references
    0 references
    0 references

    Identifiers