. "Randomized On-line Scheduling on 3 processors" . . "32" . . "We consider a randomized on-line scheduling problem where each job has to be scheduled on any of $m$ identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for $m=3$ processors must be strictly greater than $27/19$."@en . "Randomized On-line Scheduling on 3 processors"@en . . "Pravd\u011Bpodobnostn\u00ED rozvrhov\u00E1n\u00ED na 3 po\u010D\u00EDta\u010D\u00EDch"@cs . "Randomized On-line Scheduling on 3 processors" . "2" . "Tich\u00FD, Tom\u00E1\u0161" . . "7"^^ . "152;158" . . . "RIV/67985840:_____/04:00106818!RIV/2005/MSM/A05005/N" . . "1"^^ . . "Pravd\u011Bpodobnostn\u00ED rozvrhov\u00E1n\u00ED na 3 po\u010D\u00EDta\u010D\u00EDch"@cs . . . "scheduling;makespan;competitive analysis"@en . "RIV/67985840:_____/04:00106818" . "583538" . "We consider a randomized on-line scheduling problem where each job has to be scheduled on any of $m$ identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for $m=3$ processors must be strictly greater than $27/19$." . . . "1"^^ . . "[E7EB941D2E5F]" . "P(GA201/01/1195), P(LN00A056), P(ME 476), Z(AV0Z1019905)" . . "0167-6377" . "NL - Nizozemsko" . . "\u010Cl\u00E1nek studuje pravd\u011Bpodobnostn\u00ED rozvrhov\u00E1n\u00ED na 3 po\u010D\u00EDta\u010D\u00EDch."@cs . . . "Randomized On-line Scheduling on 3 processors"@en . . "Operation Research Letters" .