Pages that link to "Item:Q2719127"
From MaRDI portal
The following pages link to A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127):
Displaying 16 items.
- Confronting intractability via parameters (Q465686) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Product warranty logistics: issues and challenges. (Q1426695) (← links)
- Parallel machine scheduling with speed-up resources (Q1754306) (← links)
- On polynomial solvability of two multiprocessor scheduling problems (Q1806278) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (Q2819575) (← links)
- (Q3095030) (← links)
- (Q3115252) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs (Q4729336) (← links)
- Polynomial time approximation schemes for general multiprocessor job shop scheduling (Q4806605) (← links)
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling (Q5152478) (← links)
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time (Q5470701) (← links)