Given m states, which form a union, every year a chairman has to be selected in such a way that at any time the accumulated number of chairmen from each state is proportional to its weight. In this paper an algorithm for a chairman assignment is given which, depending on the weights, guarantees a sm
The chairman assignment problem
โ Scribed by R. Tijdeman
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 258 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
S,tppose k states form a union and every year a union chairman has Io be selected in stlch a way that at any time the accumulated number of chairmen from each state is proi3ortional 1o ils weight. In this paper a simple algorithm for a chairman assignment is givell which guarantees a small discrepancy. The situation that not only states form unions, but also unions form federations, etc., with one overall organization is also investigated.
๐ SIMILAR VOLUMES
The classical assignment problem matches n jobs to n machines in a way that minimizes total assignment costs. To allow for the possibility of diverting internal jobs outside the machine shop and accepting external jobs into the machine shop, we define the assignment problem with external interaction