Fair resource allocation for different scenarios of demands

DOI10.1016/j.ejor.2011.10.029zbMath1244.91048OpenAlexW1978779204MaRDI QIDQ439500

Eric Sanlaville, Emmanuel Medernach

Publication date: 16 August 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.2011.10.029

zbMATH Keywords

fairnessresource allocationmulticriteria optimizationgrid schedulinguncertainty on demands

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Inequity averse optimization in operational research ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About the applicability of MCDA to some robustness problems
• Social orderings for the assignment of indivisible objects
• On truthfulness and approximation for scheduling selfish tasks
• On the lexicographic minimax approach to location problems
• Robust discrete optimization and its applications
• Equitable aggregations and multiple criteria analysis
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
• A resource allocation queueing fairness measure: properties and bounds
• Rate control for communication networks: shadow prices, proportional fairness and stability
• A Short Introduction to Computational Social Choice
• Fairness in routing and load balancing
• Combining fairness with throughput: Online routing with multiple objectives

This page was built for publication: Fair resource allocation for different scenarios of demands