Project portfolio selection is a major issue in organizations, which involves a complex pro-cess from the first step to the end step of project selection. In order to pursue the organizations’ financial and physical constraints, choosing the most suitable portfolio of projects is necessary. Organizations have a number of constraints to select a portfolio of projects that must be considered. Different interactions are considered between the proposed projects. For example, resource constraints, the possibility of transferring liquidity resources that are not consumed over a period to the next, the interdependence between projects, and the synergistic impact of the projects are important. In this paper, an exponential function is considered for synergistic impact of the projects that make the problem more similar to the real-world problems. An illustrative example is used to demonstrate the appropriate application of the proposed model.

In project management, a schedule is considered as a list a project's milestones, activities, and deliverables, normally with some start and finish time schedule, which are estimated by some information incorporated in the project schedule including resource allocation, budget, task duration, and linkages of dependencies and scheduled events. This paper presents a comprehensive review of the studies associated with project scheduling. The study uses Scopus database as a primary search engine and covers 3370 records over the period 1963-2019. The records are statistically analyzed and categorized in terms of different criteria. Based on the survey, "decision support systems" is the keyword which has carried the highest densities followed by heuristics methods. Among the most cited articles, papers published by researchers in Germany have received the highest citations (9084), followed by United States (7058) and Belgium with 4853 citations.

The project scheduling problem is both practically and theoretically of paramount importance. From the practical perspective, improvement of project scheduling as a critical part of project management process can lead to successful project completion and significantly decrease of the relevant costs. From the theoretical perspective, project scheduling is regarded as one of the in-teresting optimization issues, which has attracted the attention of many researchers in the area of operations research. Therefore, the project scheduling issue has been significantly evaluated over time and has been developed from various aspects. In this research, the topics related to Re-source-Constrained Project Scheduling Problem (RCPSP) are reviewed, recent developments in this field are evaluated, and the results are presented for future studies. In this regard, first, the standard problem of RCPSP is expressed and related developments are presented from four as-pects of resources, characteristics of activities, type of objective functions, and availability level of information. Following that, details about 216 articles conducted on RCPSP during 1980-2017 are expressed. At the end, in line with the statistics obtained from the evaluation of previ-ous articles, suggestions are made for the future studies in order to help the development of new issues in this area.

multi-skilled project scheduling problem (MSPSP) has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP) with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.