MatHek
Last Activity: Aug 13 '15, 03:25 PM
Joined: Mar 13 '15
Location:
-
That sounds better, I will try to implement that -
ok, here are arrays:
I still do not see any way to change...Code:job1 job2 job3 job4 wokrer1 1 3 4 2 worker2 9 8 1 2 worker3 6 7 8 9 job1 job2 job3 job4 count 1 2 2 1 example solution: worker1: job2, job3 (7) worker2: job1, job2 (17) worker3: job3, job4 (17) sum: 41Leave a comment:
-
As far as I am concerned, Your idea is not right. Using algorithm on a part of jobs, and then on the next part, etc, requires assumption that nobody does more than one job in each part. That is why every combination of jobs in each part needs to be checked, which makes my algorithm NP. Similar problem raises up while trying to calculate one-personal jobs firstly. The best solution for all jobs does not have to contain the best solution for only a...Leave a comment:
-
You are right, I have to think it out concerning my special case. Thank You for Your help, I will write when I get to know more.Leave a comment:
-
I do not see any way to comment Your answer, so I am writing as a 'reply'. This algorithm is very nice, but my problem is a little bit more complicated. The assumption in HA is that we have n people and n jobs. I have k jobs, where k >= n. What is more, one job is to be done exactly by specified number of people, so I cannot just duplicate workers, because one worker would be selected for one job multiple times...Leave a comment:
-
Problem with finding maximal sum of happiness
Hi, I have a problem to solve, and do not see any optimal solution :/ The problem is:
I have n workers and k jobs. Each job is to be done by specified number of workers, and each worker has his level of happines for each job. I have to to make a work schedule so that workers would be as happy as possible.
So, I have array a1 of int[n,k]. k-th column of i-th row contains preference (number from 0 to 10) of i-th worker for k-th...
No activity results to display
Leave a comment: