scientific article; zbMATH DE number 1796988
From MaRDI portal
Publication:4551383
zbMath0991.68506MaRDI QIDQ4551383
Publication date: 5 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2108/21080453
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Online scheduling with partial job values: does timesharing or randomization help? ⋮ Improved competitive algorithms for online scheduling with partial job values ⋮ Preemptive scheduling in overloaded systems. ⋮ Online competitive algorithms for maximizing weighted throughput of unit jobs
This page was built for publication: