An efficient polynomial time approximation scheme for load balancing on uniformly related machines

Details An efficient polynomial time approximation scheme for load balancing on uniformly related machines An efficient polynomial time approximation scheme for load balancing on uniformly related machines

2012-02-18

arxiv.org/abs/1202.4072v1

Computer Science

Data Structures and Algorithms

Scientific paper

We consider basic problems of non-preemptive scheduling on uniformly related machines. For a given schedule, defined by a partition of the jobs into m subsets corresponding to the m machines, C_i denotes the completion time of machine i. Our goal is to find a schedule which minimizes or maximizes \sum_{i=1}^m C_i^p for a fixed value of p such that 01 the minimization problem is equivalent to the well-known problem of minimizing the \ell_p norm of the vector of the completion times of the machines, and for 0

Affiliated with

Also associated with

No associations

Rating

An efficient polynomial time approximation scheme for load balancing on uniformly related machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient polynomial time approximation scheme for load balancing on uniformly related machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient polynomial time approximation scheme for load balancing on uniformly related machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33339