Webster S.

S. Webster

Information about the author S. Webster will soon be added to the site.
Found 7 papers in total
Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
2003
This paper considers the problems of scheduling jobs on parallel identical machines...
Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates
Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates
1997
We consider the NP-hard problem of scheduling jobs on a single machine about an...
A note on schedule of n-jobs on two identical machines to minimize weighted mean flow time
A note on schedule of n-jobs on two identical machines to minimize weighted mean flow time
1994
In a recent paper, Alidaee notes the similarity between the scheduling problems of...
Weighted flow time-bounds for scheduling identical processors
Weighted flow time-bounds for scheduling identical processors
1995
We present two lower bounds for the identical parallel processor weighted now time...
Scheduling job families about an unrestricted common due date on a single machine
Scheduling job families about an unrestricted common due date on a single machine
1997
We consider the NP-hard problem of scheduling jobs on a single machine about an...
Analytical results for two-echelon distribution network design
Analytical results for two-echelon distribution network design
1994
Analytical models of single-echelon distribution systems have been reported in the...
Scheduling a flexible machining system with a dynamic tool movement
Scheduling a flexible machining system with a dynamic tool movement
1993
A recent trend in flexible machining systems is the growth in systems comprised of...
Papers per page: