One of the primary jobs a software project manager is to assign available resources development tasks in such way that results high-quality product at low cost. Software Project Scheduling (SPS) allocates most appropriate human resource activities right time reduce failure risks and minimise makespan. In literature, SPS problem referred as Multiple Resource-Constrained Problem (MRCPSP). The MRC...

On the basis of uncertainty theory, plenty of researches have been done on uncertain resource-constrained project scheduling problems. Instead of minimizing the makespan, in this paper, we address the maximization of net present value of a project’s cash flows when activity durations are assumed to be uncertain. In addition to precedence constraint and resource constraint involved in resource-c...

We consider three connected resource-constrained optimization problems: 1D bin packing (BPP), resource-constrained project scheduling (PSP), and 2D strip packing without rotation (SPP). In the context of SPP, BPP is also known as the 1D bar relaxation and PSP as the 1D contiguous relaxation. It is easy to see that SPP can be relaxed in two different ways down to a PSP: horizontal and vertical s...

The paper introduces the notion of freely completable partial solutions to characterize constraint satisfaction problems that have components which are relatively easy to solve and are only loosely connected to the remaining parts of the problem. Discovering such partial solutions during the solution process can result in strongly pruned search trees. We give a general definition of freely comp...

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...