Pages that link to "Item:Q1107984"
From MaRDI portal
The following pages link to The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984):
Displaying 22 items.
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430) (← links)
- Scheduling multiprocessor tasks on three dedicated processors (Q1197982) (← links)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← links)
- Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← 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)
- Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
- An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
- Scheduling independent tasks with multiple modes (Q1900136) (← links)
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
- Deadline scheduling of multiprocessor tasks (Q1917262) (← links)
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
- Compact cyclic edge-colorings of graphs (Q2427500) (← links)
- Consecutive edge-coloring of the generalized \(\theta \)-graph (Q2457013) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
