Job Shop Scheduling with Unit Processing Times

Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko

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 wh...