Pages that link to "Item:Q3021973"

The following pages link to APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973):

Displaying 9 items.

• Scheduling malleable tasks with precedence constraints (Q414874) (← links)
• A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
• Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
• Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width (Q3558924) (← links)
• (Q4737537) (← links)
• Algorithms for scheduling deadline-sensitive malleable tasks (Q6559486) (← links)