Pages that link to "Item:Q912611"
From MaRDI portal
The following pages link to Probabilistic single processor scheduling (Q912611):
Displaying 5 items.
- Scheduling on a single processor with variable speed (Q673343) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- The complexity of computing the Tutte polynomial on transversal matroids (Q1842565) (← links)
- Estimating the probability of meeting a deadline in schedules and plans (Q2321333) (← links)
- Scheduling tasks with failure probabilities to minimize expected cost (Q4735026) (← links)