A linear time approximation algorithm for multiprocessor scheduling
From MaRDI portal
Publication:3048240
DOI10.1007/BF01930985zbMath0413.68038MaRDI QIDQ3048240
Publication date: 1979
Published in: BIT (Search for Journal in Brave)
Related Items
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem, The shortest first coordination mechanism for a scheduling game with parallel-batching machines, The price of anarchy and stability in general noisy best-response dynamics, Exponential size neighborhoods for makespan minimization scheduling, Optimal Coordination Mechanisms for Unrelated Machine Scheduling, Worst-case Nash equilibria in restricted routing, Scheduling selfish jobs on multidimensional parallel machines, Coordination mechanisms for parallel machine scheduling, Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy, Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis, Maximizing the minimum load: the cost of selfishness, Reducing price of anarchy of selfish task allocation with more selfishness, Smoothed performance guarantees for local search, Partial solutions and multifit algorithm for multiprocessor scheduling, Strategic Scheduling Games: Equilibria and Efficiency, Bounds for the Convergence Time of Local Search in Scheduling Problems, The price of anarchy on uniformly related machines revisited, Scheduling games with rank-based utilities, The strong price of anarchy of linear bottleneck congestion games, Local search for multiprocessor scheduling: how many moves does it take to a local optimum?, Performance guarantees of jump neighborhoods on restricted related parallel machines, Non-clairvoyant scheduling games, A state-of-the-art review of parallel-machine scheduling research, Inefficiency of Nash equilibria with parallel processing policy, Improved 0/1-interchange scheduling, Strong stability of Nash equilibria in load balancing games, Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem, Approximate Strong Equilibrium in Job Scheduling Games, A coordination mechanism for a scheduling game with parallel-batching machines, A composite algorithm for multiprocessor scheduling, Minimizing labor requirements in a periodic vehicle loading problem, The cost of selfishness for maximizing the minimum load on uniformly related machines, Inefficiency of equilibria for the machine covering game on uniform machines, Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines, Price of anarchy in parallel processing, A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines, Load rebalancing games in dynamic systems with migration costs, Decentralized utilitarian mechanisms for scheduling games, The Price of Anarchy on Uniformly Related Machines Revisited, Selfish load balancing for jobs with favorite machines, Coordination mechanisms for selfish scheduling, On the price of anarchy of two-stage machine scheduling games, Local search for the minimum label spanning tree problem with bounded color classes., Tighter price of anarchy for selfish task allocation on selfish machines, Coordination mechanisms for scheduling selfish jobs with favorite machines, Structure and complexity of extreme Nash equilibria, Machine scheduling models in environmentally focused chemical manufacturing, Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines, Performance guarantees of local search for minsum scheduling problems
Cites Work
