extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

Resource constrained project scheduling problem is one of the most important issues in project planning and management. The objective function of this problem is to minimize the completion time of a project. When there is budget constraint or high risk for investment, using the criteria such as cash flows is so important. The development of computer systems and processors makes it possible to t...

Construction companies are required to employ effective methods of project planning and scheduling in today's competitive environment. Time cost critical factors success, they can vary based on the type amount resources used for activities, such as labor, tools, materials. In addition, resource leveling strategies that limit fluctuations a project's consumption also affect time cost. The multi-...

Multi-Mode Resource-Constrained Project Scheduling is an NP-hard optimization problem intensively studied due to its large area of applications. This paper concentrates on the evolutionary approaches to Multi-Mode Resource-Constrained Project Scheduling based on permutation encoded individuals. A new recombination operator is presented and a comparative analysis of several recombination operato...

This paper reports on a new solution approach for the well-known multi-mode resource-constrained project scheduling problem (MMRCPSP). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and non-renewable) resource feasible project schedule with a minimal makespan. The problem type is known to be NPh...