Abstract: This paper focused on the resolution of the project’s assignment problem. Several heuristics have been developed and proposed in this paper to serve as lower bounds to our studied problem. In a developing country, it is interesting to make an equitable distribution of projects in different cities in order to guarantee equality and regional development. Each project is characterized by its budget. The problem is to find an appropriate schedule to assign all projects to all cities. This appropriate schedule seeking the maximization of the budget in the city that having the minimum budget. In this paper, six heuristics were proposed to carry out the objective of resolving the studied problem. The experimental results show that the algorithm given by the heuristic P6r outperforms all other heuristics cited in this paper.

Mahdi Jemmali, “Budgets Balancing Algorithms for the Projects Assignment” International Journal of Advanced Computer Science and Applications(IJACSA), 10(11), 2019. http://dx.doi.org/10.14569/IJACSA.2019.0101177

@article{Jemmali2019,
title = {Budgets Balancing Algorithms for the Projects Assignment},
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2019.0101177},
url = {http://dx.doi.org/10.14569/IJACSA.2019.0101177},
year = {2019},
publisher = {The Science and Information Organization},
volume = {10},
number = {11},
author = {Mahdi Jemmali},
}