Pages that link to "Item:Q2819575"
From MaRDI portal
The following pages link to A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (Q2819575):
Displaying 10 items.
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
- Polynomial time approximation schemes for general multiprocessor job shop scheduling (Q4806605) (← links)
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time (Q5470701) (← links)
