S. T. Webster

发表

The complexity of scheduling job families about a common due date

S. T. Webster, S. Webster, 1997, Oper. Res. Lett..

Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

S. T. Webster, 1993, Oper. Res. Lett..