David P. Williamson
A note on the generalized min-sum set cover problem
On the relationship between combinatorial and LP-based lower bounds to NP-hard scheduling problems.
Two-dimensional Gantt charts and a scheduling algorithm of Lawler.
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem.
Short shop schedules.
Scheduling parallel machines on-line.
Permutation vs. non-permutation flow shop schedules.