Search

Projects are set of processes which aim to serve a unique product or a service in a time-bounded period. Pressure in terms of accelerating the time to market of the unique product or service has become the reality in every organization. Thus, companies need to search for new methodologies to schedule projects effectively. This paper presents a new mathematical model to schedule resource constrained projects in accordance with their logical relationships. Optimal solution of this complex model cannot be found in case of a high number of activities. Therefore, a new hybrid metaheuristic is proposed to find efficient solutions. Moreover, the proposed methodology is applied to schedule projects in a Turkish technology company. For 154 projects completed between 2018 and 2020, proposed methods finds on the average 3.91% better solution in 178 seconds compared to solutions obtained by CPLEX in 34,883 seconds. Proposed methods are also applied for 64 projects planned in 2021 and finds on the average 5% better results in 130 seconds compared to solutions found by CPLEX in 35,438 seconds. In brief, the proposed methodology provides efficient solutions with a very small number of delayed projects, reliable plans, better solution time and objective function value. [ABSTRACT FROM AUTHOR]