An improved lower bound for rank four scheduling
DOI10.1016/J.ORL.2014.06.003zbMATH Open1408.90123OpenAlexW2016342875MaRDI QIDQ1785250FDOQ1785250
Authors: Lin Chen, Deshi Ye, Guochuan Zhang 
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.06.003
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
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)
Cites Work
- Title not available (Why is that?)
- A simplified NP-complete satisfiability problem
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Approximation algorithms for scheduling unrelated parallel machines
- An optimal rounding gives a better approximation for scheduling unrelated machines
- On the optimality of approximation schemes for the classical scheduling problem
- Minimum Makespan Scheduling with Low Rank Processing Times
Cited In (4)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- An EPTAS for scheduling on unrelated machines of few different types
- A PTAS for Scheduling Unrelated Machines of Few Different Types
- On the optimality of exact and approximation algorithms for scheduling problems
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)
