An improved lower bound for rank four scheduling
From MaRDI portal
Publication:1785250
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Minimum makespan scheduling with low rank processing times
- Parameterized and approximation results for scheduling with a low rank processing time matrix
- On the optimality of approximation schemes for the classical scheduling problem
- Non-approximability results for scheduling problems with minsum criteria
- Approximation algorithms for scheduling unrelated parallel machines
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A simplified NP-complete satisfiability problem
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Minimum makespan scheduling with low rank processing times
- On the optimality of approximation schemes for the classical scheduling problem
Cited in
(5)- Minimum makespan scheduling with low rank processing times
- A PTAS for scheduling unrelated machines of few different types
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- On the optimality of exact and approximation algorithms for scheduling problems
- Parameterized and approximation results for scheduling with a low rank processing time matrix
This page was built for publication: An improved lower bound for rank four scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785250)
