Scott R. Smallwood

According to our database, Scott R. Smallwood authored at least 2 papers between 1997 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths.

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma

Math. Oper. Res., 2001

1997

Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997