Makespan minimization in preemptive two machine job shops

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 processing times

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Job Shop Scheduling with Unit Processing Times

Mathematics of Operations Research

Hardness of Approximating Flow and Job Shop Scheduling Problems

Journal of the ACM (JACM)

Subsequence packing: complexity, approximation, and application

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

An optimal method for the preemptive job shop scheduling problem

Computers and Operations Research