Fair resource allocation for different scenarios of demands
type: Item
instance of: scholarly article
title: Fair resource allocation for different scenarios of demands
zbMATH Open document ID: 1244.91048
author: Emmanuel Medernach
author: Eric Sanlaville
published in: European Journal of Operational Research
publication date: 2012-08-16T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6066851
zbMATH Keywords: resource allocation
zbMATH Keywords: fairness
zbMATH Keywords: uncertainty on demands
zbMATH Keywords: grid scheduling
zbMATH Keywords: multicriteria optimization
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.10.029
OpenAlex ID: W1978779204
cites work: On truthfulness and approximation for scheduling selfish tasks
cites work: Q4230343
cites work: A Short Introduction to Computational Social Choice
cites work: Approximate majorization and fair online load balancing
cites work: Combining fairness with throughput: Online routing with multiple objectives
cites work: About the applicability of MCDA to some robustness problems
cites work: Rate control for communication networks: shadow prices, proportional fairness and stability
cites work: Fairness in routing and load balancing
cites work: Equitable aggregations and multiple criteria analysis
cites work: Robust discrete optimization and its applications
cites work: Social orderings for the assignment of indivisible objects
cites work: Q3993509
cites work: On the lexicographic minimax approach to location problems
cites work: A resource allocation queueing fairness measure: properties and bounds
cites work: Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
cites work: Q4681749
DOI: 10.1016/J.EJOR.2011.10.029
description: scientific article; zbMATH DE number 6066851