All-Norm Approximation for Scheduling on Identical Machines

2004 ◽  
pp. 298-310 ◽  
Author(s):  
Yossi Azar ◽  
Shai Taub
Keyword(s):  
Identical Machines ◽  
Norm Approximation

On Hankel-Norm Approximation of Large-Scale Markov Chains

1991 ◽  
Author(s):  
Guanrong Chen ◽  
Charles K. Chui ◽  
Yaoqi Yu
Keyword(s):  
Markov Chains ◽  
Large Scale ◽  
Hankel Norm ◽  
Norm Approximation

scholarly journals All-norm approximation algorithms

2004 ◽  
Vol 52 (2) ◽  
pp. 120-133 ◽  
Author(s):  
Yossi Azar ◽  
Leah Epstein ◽  
Yossi Richter ◽  
Gerhard J Woeginger
Keyword(s):  
Approximation Algorithms ◽  
Norm Approximation

scholarly journals Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime

1986 ◽  
Vol 23 (03) ◽  
pp. 841-847 ◽  
Author(s):  
R. R. Weber ◽  
P. Varaiya ◽  
J. Walrand
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Preemptive Scheduling ◽  
Total Reward ◽  
Processing Times ◽  
Identical Machines ◽  
Scheduling Strategies

A number of jobs are to be processed using a number of identical machines which operate in parallel. The processing times of the jobs are stochastic, but have known distributions which are stochastically ordered. A reward r(t) is acquired when a job is completed at time t. The function r(t) is assumed to be convex and decreasing in t. It is shown that within the class of non-preemptive scheduling strategies the strategy SEPT maximizes the expected total reward. This strategy is one which whenever a machine becomes available starts processing the remaining job with the shortest expected processing time. In particular, for r(t) = – t, this strategy minimizes the expected flowtime.

Sign in / Sign up

Export Citation Format

Share Document