Non-clairvoyant Precedence Constrained Scheduling

ICALP, 2019.

Cited by: 2|Views31
EI

Abstract:

We consider the online problem of scheduling jobs on identical machines, where jobs have precedence constraints. We are interested in the demanding setting where the jobs sizes are not known up-front, but are revealed only upon completion (the non-clairvoyant setting). Such precedence-constrained scheduling problems routinely arise in m...More

Code:

Data:

Your rating :
0

 

Tags
Comments