Coordination mechanisms with hybrid local policies

DOI10.1016/j.disopt.2011.05.001zbMath1235.90065OpenAlexW2028631731MaRDI QIDQ408369

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

Publication date: 5 April 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2011.05.001

zbMATH Keywords

makespantotal completion timeprice of anarchycoordination mechanismeligibility constraintsmixed local policy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Coordination mechanisms for parallel machine scheduling ⋮ Coordination mechanisms for scheduling games with machine modification ⋮ Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ Improved bounds for online scheduling with eligibility constraints

Cites Work

• Unnamed Item
• Coordination mechanisms
• Coordination mechanisms for selfish scheduling
• Parallel machine scheduling under a grade of service provision
• New approximation bounds for LPT scheduling
• Scheduling Independent Tasks on Uniform Processors
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Bounds for List Schedules on Uniform Processors
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Coordination mechanisms with hybrid local policies