Price of fairness in scheduling

What is it about?

We investigate the concept of price of fairness in resource allocation and apply it to two-agent single- machine scheduling problems, in which two agents, each having a set of jobs, compete for use of a single machine to execute their jobs. We consider the situation where one agent aims at minimizing the total of the completion times of his jobs, while the other seeks to minimize the maximum tardiness with respect to a common due date for her jobs. We first explore and propose a definition of utility, then we study both max-min and proportionally fair solutions, providing a tight bound on the price of fairness for each notion of fairness. We extend our study further to the problem in which both agents wish to minimize the total of the completion times of their own jobs.

Featured Image

Why is it important?

* Introducing the notion of price of fairness to scheduling problems. * Establishing tight bounds on price of fairness for two most common fairness notions. * Extending the research to a general setting.