S. T. Webster

Available identifiers

zbMath Open webster.s-tMaRDI QIDQ1266723

List of research outcomes

Publication	Date of Publication	Type
A general lower bound for the makespan problem	1998-10-07	Paper
The complexity of scheduling job families about a common due date	1997-12-17	Paper
Bounds and asymptotic results for the uniform parallel processor weighted flow time problem	1995-01-19	Paper
A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems	1994-08-31	Paper

Research outcomes over time

This page was built for person: S. T. Webster