THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING

DOI10.1142/S0129626412500065zbMath1253.68077OpenAlexW2092989314MaRDI QIDQ3144935

Tomoko Izumi, Taisuke Izumi, Fukuhito Ooshita

Publication date: 12 December 2012

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626412500065

zbMATH Keywords

computational complexityapproximation algorithmscheduling algorithmheterogeneous parallel computing environmentsmulti-organization scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Efficiency and equity in the multi organization scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Cooperative power-aware scheduling in grid computing environments
• Approximation algorithms for scheduling unrelated parallel machines
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Coordination mechanisms for selfish scheduling
• Promoting cooperation in selfish computational grids
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Mechanism design for fractional scheduling on unrelated machines
• Efficiency and fairness of system-optimal routing with user constraints
• Algorithms for Scheduling Tasks on Unrelated Processors
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• Algorithmic mechanism design

This page was built for publication: THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING