Pages that link to "Item:Q2892310"
From MaRDI portal
The following pages link to Performance guarantees of local search for multiprocessor scheduling (Q2892310):
Displaying 42 items.
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis (Q389954) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
- Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905) (← links)
- Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling (Q2898033) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling (Q3557013) (← links)
- A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← links)
- Worst-case analysis of local search heuristic for the one-machine total tardiness problem (Q4735025) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)
- The price of anarchy for a berth allocation game (Q6547129) (← links)
- Nonatomic non-cooperative neighbourhood balancing games (Q6614537) (← links)