On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper we explore the issue in settings where there are long living processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system. For any such instance we develop a notion of desired load of a process, which is a function of the tasks it participates in. The unfairness of a system is the maximum, taken over all processes, of the difference between the desired load and the actual load.
An example of such a setting is the carpool problem suggested by Fagin and Williams (IBM Journal of Research and Development, vol. 27, 1983). In this problem, a set of n people form a carpool. On each day a subset of the people arrive and one of them is designated as the driver. A scheduling rule is required so that the driver will be determined in a `fair' way.
We investigate this problem under various assumptions on the input distribution. We also show that the carpool problems can capture several other problems of fairness in scheduling.
Postscript , gzipped Postscript , PDF.
Slides for a related lecture: pps
Related On-Line Papers:
Moni Naor, On Fairness in the Carpool Problem, Abstract, Postscript , gzipped Postscript , PDF .
Back to On-Line Publications
Back to the Puzzler