1. Abraham, D.: Algorithmics of two-sided matching problems. Master’s thesis, Department of Computer Science, University of Glasgow (2003)
2. Blażewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on scheduling: from theory to applications
3. Bokal, D., Bresar, B., Jerebic, J.: A generalization of hungarian method and hall’s theorem with applications in wireless sensor networks. arXiv/0911.1269 (2009)
4. Bruno, J.L., Coffman Jr., E.G., Sethi, R.: Algorithms for minimizing mean flow time. In: IFIP Congress, pp. 504–510 (1974)
5. Bruno, J.L., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. ACM Commun. 17(7), 382–387 (1974)