Pages that link to "Item:Q3048240"

The following pages link to A linear time approximation algorithm for multiprocessor scheduling (Q3048240):

Displayed 50 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)
• Strong stability of Nash equilibria in load balancing games (Q477108) ‎ (← links)
• Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) ‎ (← links)
• A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) ‎ (← links)
• A composite algorithm for multiprocessor scheduling (Q544815) ‎ (← 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)
• Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) ‎ (← links)
• Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) ‎ (← links)
• The strong price of anarchy of linear bottleneck congestion games (Q905688) ‎ (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) ‎ (← links)
• Price of anarchy in parallel processing (Q991788) ‎ (← links)
• Coordination mechanisms for selfish scheduling (Q1014630) ‎ (← links)
• Improved 0/1-interchange scheduling (Q1169295) ‎ (← links)
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) ‎ (← links)
• Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905) ‎ (← links)
• The price of anarchy and stability in general noisy best-response dynamics (Q1621728) ‎ (← links)
• Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) ‎ (← links)
• Coordination mechanisms for parallel machine scheduling (Q1926738) ‎ (← links)
• The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) ‎ (← links)
• On the price of anarchy of two-stage machine scheduling games (Q2051911) ‎ (← links)
• Tighter price of anarchy for selfish task allocation on selfish machines (Q2082200) ‎ (← links)
• Performance guarantees of local search for minsum scheduling problems (Q2118098) ‎ (← links)
• Selfish load balancing for jobs with favorite machines (Q2294253) ‎ (← 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)
• Scheduling selfish jobs on multidimensional parallel machines (Q2404079) ‎ (← links)
• Inefficiency of Nash equilibria with parallel processing policy (Q2444737) ‎ (← links)
• Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) ‎ (← links)
• Decentralized utilitarian mechanisms for scheduling games (Q2516246) ‎ (← links)
• Structure and complexity of extreme Nash equilibria (Q2570130) ‎ (← links)
• Worst-case Nash equilibria in restricted routing (Q2637289) ‎ (← links)
• Exponential size neighborhoods for makespan minimization scheduling (Q2892138) ‎ (← links)
• Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) ‎ (← links)
• Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) ‎ (← links)
• Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines (Q3439462) ‎ (← links)
• Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) ‎ (← links)
• Machine scheduling models in environmentally focused chemical manufacturing (Q4230056) ‎ (← links)
• A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) ‎ (← 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)
• Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) ‎ (← links)
• Load rebalancing games in dynamic systems with migration costs (Q5964072) ‎ (← links)