The following pages link to (Q4791892):
Displaying 4 items.
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time (Q1762110) (← links)
- Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
