𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial time algorithm for Zero-Clairvoyant scheduling

✍ Scribed by K. Subramani

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
206 KB
Volume
5
Category
Article
ISSN
1570-8683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Non-clairvoyant scheduling for weighted
Non-clairvoyant scheduling for weighted flow time
✍ Jae-Hoon Kim; Kyung-Yong Chwa πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 115 KB

A non-clairvoyant scheduler makes decisions having no knowledge of jobs. It does not know when the jobs will arrive in the future, that is, it is online, and how long the jobs will be executed after they arrive. For non-clairvoyant scheduling, we first study the problem to minimize the total stretch

Polynomial time approximation algorithms
Polynomial time approximation algorithms for machine scheduling: ten open problems
✍ Petra Schuurman; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 91 KB πŸ‘ 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

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