1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading, Mass: Addison-Wesley 1974
2. Brown, M.R.: The analysis of a practical and nearly optimal priority queue. Stanford Ph.D. Dissertation. STAN-CS-77-600, Stanford University, 1977
3. Bruno, J.L.: Mean weighted flow-time criterion: In Computer and Job-Shop Scheduling Theory, E.G. Coffman, ed., pp. 101?138. New York: John Wiley 1976
4. Horn, W.A.: Single-machine job sequencing with treelike precedence ordering and linear delay panalties. SIAM J. Appl. Math. 23, 189?202 (1972)
5. Megiddo, N.: Computational complexity of the game theory approach to cost allocation for a tree. MOR 3, 189?196 (1978)