A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit

Details A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit

2011-03-16

arxiv.org/abs/1103.3224v1

Mathematics

Optimization and Control

This work is part of what I did as a graduate student in the Academy of Mathematics and Systems Science

Scientific paper

We discuss a variant of multitask n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem asks all vehicles in a group to arrive at a same destination. It can also be viewed as to maximize every processor's average profit, given n tasks, and each task's consume-time and profit. Meanwhile, we propose a new kind of partition problem in fractional form, and analyze its computational complexity. Moreover, by regarding fractional partition as a special case, we prove that the maximizing average profit problem is NP-hard when the number of processors is fixed and it is strongly NP-hard in general. At last, a pseudo-polynomial time algorithm for the maximizing average profit problem and the fractional partition problem is presented, thanks to the idea of the pseudo-polynomial time algorithm for the classical partition problem.

Affiliated with

Also associated with

No associations

Rating

A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit 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 variant of multitask n-vehicle exploration problem: maximizing every processor's average profit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263672