The optimality of the online greedy algorithm in carpool and chairman assignment problems

Authors:
Don Coppersmith;Tomasz Nowicki;Giuseppe Paleologo;Charles Tresser;Chai Wah Wu
Affiliations:
IBM;IBM;IBM;IBM;IBM
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2011

Citing 4
Cited 0

Fairness in scheduling

Journal of Algorithms - Special issue on SODA '95 papers
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The mathematics of halftoning

IBM Journal of Research and Development
A fair carpool scheduling algorithm

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study several classes of related scheduling problems including the carpool problem, its generalization to arbitrary inputs and the chairman assignment problem. We derive both lower and upper bounds for online algorithms solving these problems. We show that the greedy algorithm is optimal among online algorithms for the chairman assignment problem and the generalized carpool problem. We also consider geometric versions of these problems and show how the bounds adapt to these cases.