A review of algorithms for solving the project scheduling problem with resource-constrained considering agricultural problems

Scheduling projects in agriculture include operations and activities that are carried out in a certain order and within a certain period of time. If these operations and activities are not performed on time, due to the quantitative and qualitative decline of the product, a heavy decrease in the income of the farmer or agricultural unit will occur, and these costs are invisible. On the other hand, agricultural operations require the use of resources for implementation, which are usually limited, and if the activities are not optimally allocated, the possibility of the activities not being on time increases. In order to reduce the costs of not being on time, these projects require planning, scheduling and scientific and logical management of time and resources. This has become a standard problem in the field of project scheduling, which has attracted many researchers and they have used different scheduling methods, including exact methods and exploratory and meta-exploratory methods. As a result, various methods of project scheduling problem with limited primary resources have been developed. This article is an overview of research methods and analysis of existing methods that have been published so far. In this article, the goals and approaches to solving the project scheduling problem have been investigated, taking into account some existing works in the field of agriculture, as well as related data.