Job shop scheduling with unit processing times

Authors:
Nikhil Bansal;Tracy Kimbrel;Maxim Sviridenko
Affiliations:
IBM T.J. Watson Research Center, Yorktown Heights;IBM T.J. Watson Research Center, Yorktown Heights;IBM T.J. Watson Research Center, Yorktown Heights
Venue:
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2005

Citing 9
Cited 2

Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
On some geometric methods in scheduling theory: a survey

Discrete Applied Mathematics
NP-hardness of shop-scheduling problems with three jobs

Discrete Applied Mathematics
Makespan minimization in preemptive two machine job shops

Computing
Expected Length of the Longest Probe Sequence in Hash Code Searching

Journal of the ACM (JACM)
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
Tighter bounds on preemptive job shop scheduling with two machines

Computing
Better Approximation Guarantees for Job-Shop Scheduling

SIAM Journal on Discrete Mathematics
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme

SIAM Journal on Discrete Mathematics

Subsequence packing: complexity, approximation, and application

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Non-clairvoyant weighted flow time scheduling on different multi-processor models

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider randomized algorithms for the preemptive job shop problem, or equivalently, the case in which all operations have unit length. We give an α-approximation for the case of two machines where α O(log m/log log m) for an arbitrary number m of machines, and the first (2+ε)-approximation for a constant number of machines. The first result is via an approximation algorithm for a string matching problem which is of independent interest.