In today’s competitive environment, projects must be implemented at a lower cost and in less time, and resources must be used optimally. Therefore, project management and scheduling using an efficient tool is a necessity. Resource constraint project scheduling (RCPSP) is one of the most widely...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all...

It is well-known that for many project scheduling problems the Space AS of active schedules contains at least one optimal solution for each feasible instance, so restricting heuristic construction methods to AS will improve algorithmic efficiency without foresaking the chance to eventually find...

This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the...