Graham's Schedules and the Number Partition Problem

Details Graham's Schedules and the Number Partition Problem Graham's Schedules and the Number Partition Problem

2008-08-07

arxiv.org/abs/0808.1119v1

Computer Science

Computational Complexity

6 pages, 1 table

Scientific paper

We show the equivalence of the Number Partition Problem and the two processor scheduling problem. We establish a priori bounds on the completion times for the scheduling problem which are tighter than Graham's but almost on par with a posteriori bounds of Coffman and Sethi. We conclude the paper with a characterization of the asymptotic behavior of the scheduling problem which relates to the spread of the processing times and the number of jobs.

Affiliated with

Also associated with

No associations

Rating

Graham's Schedules and the Number Partition Problem 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 Graham's Schedules and the Number Partition Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graham's Schedules and the Number Partition Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29077