𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems

✍ Scribed by E. N. Barron; R. Jensen

Book ID
105012085
Publisher
Springer
Year
1986
Tongue
English
Weight
442 KB
Volume
50
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On polynomial-time approximation algorit
On polynomial-time approximation algorithms for the variable length scheduling problem
✍ Artur Czumaj; Leszek GaΜ§sieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Ry πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 195 KB

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), ( 2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1; k2, denoted VLSP(k1; k2). In the current paper, we ΓΏrst discuss a