Better approximation guarantees for job-shop scheduling

Authors:
Leslie Ann Goldberg;Mike Paterson;Aravind Srinivasan;Elizabeth Sweedyk
Affiliations:
Dept. of Computer Science, University of Warwick, Coventry CV4 7AL, UK;Dept. of Computer Science, University of Warwick, Coventry CV4 7AL, UK;Dept. of Information Systems and Computer Science, National University of Singapore, Singapore 119260;Department of Computer and Information Sciences, University of Pennsylvania
Venue:
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Year:
1997

An algorithm for solving the job-shop problem

Management Science
Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
Randomized algorithms

Randomized algorithms
Chernoff-Hoeffding Bounds for Applications with Limited Independence

SIAM Journal on Discrete Mathematics
Bandwidth allocation with preemption

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improved Parallel Approximation of a Class of Integer Programming Programming Problems

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Approximability of flow shop scheduling

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Improved bounds for acyclic job shop scheduling (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Makespan minimization in job shops: a polynomial time approximation scheme

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
New and improved algorithms for minsum shop scheduling

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Tighter bounds on preemptive job shop scheduling with two machines

Computing
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Randomized Algorithm for Flow Shop Scheduling

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Assignment problems in rental markets

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The lovász-local-lemma and scheduling

Efficient Approximation and Online Algorithms
An optimal method for the preemptive job shop scheduling problem

Computers and Operations Research

Hi-index	0.00