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
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of 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
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM)
High-multiplicity cyclic job shop scheduling
Operations Research Letters
An optimal method for the preemptive job shop scheduling problem
Computers and Operations Research
Hi-index | 0.00 |
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 that is of independent interest.