Pages that link to "Item:Q1897367"
From MaRDI portal
The following pages link to An approximation algorithm for scheduling on three dedicated machines (Q1897367):
Displayed 7 items.
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
- Scheduling groups of tasks with precedence constraints on three dedicated processors. (Q1421466) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)