Webster Scott T.

Scott T. Webster

Information about the author Scott T. Webster will soon be added to the site.
Found 3 papers in total
A general lower bound for the makespan problem
A general lower bound for the makespan problem
1996
The problem of scheduling jobs on identical parallel processors to minimize makespan...
Scheduling groups of jobs on a single machine
Scheduling groups of jobs on a single machine
1995
Economies of scale are fundamental to manufacturing operations. With respect to...
The complexity of scheduling job families about a common due date
The complexity of scheduling job families about a common due date
1997
Family scheduling problems are characterized by a setup time structure where setups...
Papers per page: