1. J. Beardwood, J.H. Halton & J.M. Hammersley (1959), “The shortest path through many points”, Proc. Cambridge Philos. Soc. 55, 299–327.
2. M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra & A.H.G. Rinnooy Kan (1983) “Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems”, Math. Op. Res. 8, 525–538.
3. P. Erdös & J. Spencer (1974), Probabilistic Methods in Combinatorics, Academic Press.
4. J.B.G. Frenk & A.H.G. Rinnooy Kan (1984), “The asymptotic optimality of the LPT rule”, Technical report, Erasmus University Rotterdam.
5. J.B.G. Frenk & A.G.H. Rinnooy Kan (1984a), “Order statistics and the linear assignment problem”, Technical Report, Erasmus University Rotterdam.