On the optimality of approximation schemes for the classical scheduling problem

@article{Chen2014OnTO,
title={On the optimality of approximation schemes for the classical scheduling problem},
author={Lin Chen and Klaus Jansen and Guochuan Zhang},
journal={ArXiv},
year={2014},
volume={abs/1310.0398}
}
• Published in SODA 2014
• Computer Science, Mathematics
• We consider the classical scheduling problem on parallel identical machines to minimize the makespan, and achieve the following results under the Exponential Time Hypothesis (ETH) 1. The scheduling problem on a constant number $m$ of identical machines, which is denoted as $Pm||C_{max}$, is known to admit a fully polynomial time approximation scheme (FPTAS) of running time $O(n) + (1/\epsilon)^{O(m)}$ (indeed, the algorithm works for an even more general problem where machines are unrelated… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

Scalable Blockchain Based Smart Contract Execution

• Zhimin Gao, +3 authors Weidong Shi
• Computer Science
• 2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS)
• 2017
VIEW 1 EXCERPT
CITES METHODS

Streaming Algorithms for Bin Packing and Vector Scheduling

• Computer Science, Mathematics
• WAOA
• 2019
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Algorithms for Scheduling and Routing Problems

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Covering a tree with rooted subtrees

• Mathematics, Computer Science
• ArXiv
• 2019
VIEW 1 EXCERPT

Covering a tree with rooted subtrees - parameterized and approximation algorithms

• Computer Science
• SODA
• 2018
VIEW 1 EXCERPT

Sailing Routes in the World of Computation

• Computer Science
• Lecture Notes in Computer Science
• 2018

Bounds and approximation results for scheduling coupled-tasks with compatibility constraints

• Computer Science, Mathematics
• ArXiv
• 2017

New Algorithmic Results for Bin Packing and Scheduling

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

Closing the Gap for Makespan Scheduling via Sparsification Techniques

• Mathematics, Computer Science
• ICALP
• 2016
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS

Packing Groups of Items into Multiple Knapsacks

• Mathematics, Computer Science
• STACS
• 2016

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

• Timon Hertli
• Mathematics, Computer Science
• 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
• 2011

Exact and Approximate Algorithms for Scheduling Nonidentical Processors

• Computer Science
• JACM
• 1976
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

A simplified NP-complete satisfiability problem

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Bounding the Running Time of Algorithms for Scheduling and Packing Problems

• Mathematics, Computer Science
• SIAM J. Discrete Math.
• 2016
VIEW 1 EXCERPT

Minimum Makespan Scheduling with Low Rank Processing Times

• Mathematics, Computer Science
• SODA
• 2013
VIEW 2 EXCERPTS

Johnson: "computers and intractability

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Lower bounds based on the Exponential Time Hypothesis

• Mathematics, Computer Science
• Bulletin of the EATCS
• 2011
VIEW 1 EXCERPT

Scheduling Jobs on Identical and Uniform Processors Revisited

• Mathematics, Computer Science
• WAOA
• 2011
VIEW 2 EXCERPTS

A Simple O(2sqrt(x)) Algorithm for Partition and Subset Sum

• Computer Science
• FCS
• 2010
VIEW 1 EXCERPT

On the possibility of faster SAT algorithms

• Computer Science, Mathematics
• SODA '10
• 2010
VIEW 2 EXCERPTS