The motivation for studying the issues of this paper comes from apossible use in controlling satelite signals. We wish to minimizethe time spent when several signals are sent through asatelite-station. The speed is limited by the number of frequenciesthe signals can be transmitted on. The frequencies are split intotime-intervals. The goal is to send a given number of signals asquickly as possible through the station given a priority of eachsignal. Signals with high priority should be sent first, while othersignals can wait a while without the delay causing problems (likephonecall versus fax).In this paper, we study a linear programming model of this problem. Thepaper starts with some background theory and a presentation of theproblem. Then traditional algorithms are described. Anapproximation-algorithm based on own ideas is also explained. The newalgorithm is based on the Monge-criteria. Both thetraditional algorithms and the new algorithm are implemented andtested. The results are presented and discussed. For matrices where the rows are quite similar, the new algorithm seemsto give good results fast. For randomly generated (increasing) rows,the simplex algorithm for transportation problems give the bestresults. Some simplification of the cost-matrice can lead to optimal solutionof the problem in linear time. This is shown in the last chapter.