I need to complete an algorithm that matches Tasks with top ranked workers

Hi Guys

I am currently trying to apply an algorithm that matches tasks with workers and I am stuck in it although my supervisor gave me a great push in it.

What is required from me is to apply lines 6 till 15 of Algorithm2

I will try to explain it to you: Every worker has a utility list of tasks he can do and also a restriction of maximum workload or number of tasks he can do. On the other side, each task has a benifit list of workers that are allocated to it and a restriction of maximum number of workers it can allocated to

,Based on Workers' utility list, Tasks' benifit list , maximum workload of each worker, and maximum number of workers per each task, I have to generate pair of matched workers and tasks.

After that, and based on the ranking of workers in each task benifit list and worker Utility list, the matched pairs will either stay ,or removed from their matched pair matrix

, Tasks are T, Workers are W, Utiliy List is U1, Benifit List is B1 , worker Maximum workload is W_j

Task Maximum worker is t_i , and further variables will be explained in the paper

I hope the situation is clear now to you, and you can have a look at the paper to get a deeper understanding if my explanation is not enough for you.

The lines in the matlab file (named : June_ex...) are from : 188 onwards

The pages you can look at the paper (attached) are : 7 and 8,

Figure 2 stage 2 will give you an example of the process that is explained in page 8. I will highlight the text

you need to read in blue. I hope everything is clear

Check the attachments