Rinnooy Kan, A.H.G.

process problem machine result algorithm number processing heuristic simulator value slave distribution subproblem solution analysis instance scheduling section function assignment processing time message branch processing times theorem rinnooy kan order simulation event communication frenk master point system interval n-job instance proof job 1 breakpoint example rinnooy method university variable schedule reassignment points boulder algorithm permutation level lpt rule list scheduling rule n-job condition request probability j.b.g boulder statistic decision solution value parameter problem instance uniform distribution communication link dp _read simulator process t h e program execution research mathematics assumption job q slice increase knowledge reassignment consequence uniform order statistics