Job Shop Scheduling with Unit Processing Times

We consider randomized algorithms for the preemptive job shop problem, or equivalently, the case in which all operations have unit length. We give an improved approximation ratio of for an arbitrary number m of machines, the first approximation for all constant numbers of machines, and an approximation for the case of two machines where < 1.45. The last result is via an approximation algorithm for a string matching problem which is of independent interest.

By: Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko

Published in: RC23273 in 2004


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .