A PTAS for Scheduling with Tree Assignment Restrictions

Details A PTAS for Scheduling with Tree Assignment Restrictions A PTAS for Scheduling with Tree Assignment Restrictions

2010-09-23

arxiv.org/abs/1009.4529v1

Computer Science

Data Structures and Algorithms

6 pages

Scientific paper

Scheduling with assignment restrictions is an important special case of scheduling unrelated machines which has attracted much attention in the recent past. While a lower bound on approximability of 3/2 is known for its most general setting, subclasses of the problem admit polynomial-time approximation schemes. This note provides a PTAS for tree-like hierarchical structures, improving on a recent 4/3-approximation by Huo and Leung.

Affiliated with

Also associated with

No associations

Rating

A PTAS for Scheduling with Tree Assignment Restrictions 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 A PTAS for Scheduling with Tree Assignment Restrictions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A PTAS for Scheduling with Tree Assignment Restrictions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338294