"1" . "We are given a set of tasks with release times, deadlines, and profit rates. In the metered model, a task brings profit proportional to the execution time even if not completed. We present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms."@en . . . "183;197" . . . "7"^^ . "67" . . . "scheduling; online algorithms; benefit"@en . . "Chrobak, M." . "Noga, J." . "0022-0000" . "Vakhania, N." . "15"^^ . . "Preemptive scheduling in overloaded systems."@en . . "Preemptive scheduling in overloaded systems." . "van Stee, R." . . . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . . . . . "Preemptive scheduling in overloaded systems."@en . "622587" . "Sgall, Ji\u0159\u00ED" . "[55D2297A79D4]" . "Preemptive scheduling in overloaded systems." . . "Epstein, L." . "0"^^ . "P(GA201/01/1195), P(IAA1019901), P(LN00A056), P(ME 476), Z(AV0Z1019905), Z(MSM 113200005)" . "0"^^ . . . "RIV/67985840:_____/03:05030084!RIV/2004/MSM/A05004/N" . "Tich\u00FD, Tom\u00E1\u0161" . "RIV/67985840:_____/03:05030084" . . . "We are given a set of tasks with release times, deadlines, and profit rates. In the metered model, a task brings profit proportional to the execution time even if not completed. We present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms." . "Journal of Computer and System Sciences" . "2"^^ . . .