Pages that link to "Item:Q3789320"
From MaRDI portal
The following pages link to APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3789320):
Displaying 12 items.
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Worst-case analysis of a scheduling algorithm (Q1060946) (← links)
- A new performance measure for scheduling independent real-time tasks (Q1309223) (← links)
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system (Q1315909) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Little-preemptive scheduling on unrelated processors (Q1868263) (← links)
- Scheduling of conditional executed jobs on unrelated processors (Q1897352) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3830805) (← links)
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations (Q4319223) (← links)
- Experimental and Efficient Algorithms (Q5710026) (← links)
