The thesis deals with the traffic optimization problem arizing in SS/TDMA satellite systems. This problem is known in existing literature both as the "bipartite scheduling problem" and the "timeslot asssignment problem". One aim of the thesis is to serve as an intoduction to the field, and to present extisting results and proofs in a thorough and accessible manner.
It is also the aim of the thesis to generalize certain existing results to the case where the number of antennas is less than the number of senders or receivers. The most important of these generalizations is the definition of the k-unvarying matrices and biprtite graphs. For a k-unvarying traffic matrix, there is a polynomial algorithm that solves the traffic optimization problemin polynomial time for an SS/TDMA satellite system with k antennas.
There is in the thesis also given an empirical analysis of the performance of 4 different heuristics for the problem.