Pages that link to "Item:Q892832"
From MaRDI portal
The following pages link to Scheduling semi-malleable jobs to minimize mean flow time (Q892832):
Displaying 7 items.
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- Resource loading with time windows (Q319369) (← links)
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time (Q1762110) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Scheduling fully parallel jobs (Q2317138) (← links)
- Scheduling non-preemptible jobs to minimize peak demand (Q2633192) (← links)