Coordination mechanisms for parallel machine scheduling

DOI10.1016/j.ejor.2012.02.001zbMath1253.90112OpenAlexW2038977346MaRDI QIDQ1926738

Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.001

zbMATH Keywords

gameparallel machine schedulingprice of anarchycoordination mechanismsabsolute price of anarchy

Mathematics Subject Classification ID

Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis ⋮ Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ Coordination mechanisms for scheduling games with proportional deterioration ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms ⋮ Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coordination mechanisms with hybrid local policies
• Coordination mechanisms
• Nash equilibria in competitive project scheduling
• Coordination mechanisms for selfish scheduling
• Promoting cooperation in selfish computational grids
• A strongly polynomial algorithm for the transportation problem
• New approximation bounds for LPT scheduling
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Scheduling Independent Tasks on Uniform Processors
• Faster algorithms for the shortest path problem
• Tight Bounds for Selfish and Greedy Load Balancing
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Bounds for List Schedules on Uniform Processors
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Inner product spaces for MinSum coordination mechanisms
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Coordination mechanisms for parallel machine scheduling