Pages that link to "Item:Q286992"
From MaRDI portal
The following pages link to An approximation result for a duo-processor task scheduling problem (Q286992):
Displaying 8 items.
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- Scheduling independent two processor tasks on a uniform duo-processor system (Q751995) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
- (Q4233360) (← links)
- An approximation result for a periodic allocation problem (Q5946816) (← links)