Due to the development of management idea and the scarcity of some resources, the lean management has become the necessary request to implement effective control of resource constrained project. Resource constrained project scheduling is the significant guarantee to attain the lean management. The resource constrained project scheduling problem (RCPSP), with the objective of minimizing project ...

We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open-pit mine production scheduling problem. We present a new algorithm for solving the LP relaxation of this problem and an LP-based heuristic to obtain feasible solutions. Computational experiments show that we can solve...

Consider the problem of sequencing n jobs with general precedence constraints on a single machine to minimize total weighted completion time, which is NP-complete. However some class of problems can be solved in polynomial time, i.e .. the problems whose precedence constraints are trees or series parallel. This paper proposes an O(n4) algorithm for implementing a decomposition procedure due to ...

Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...

This paper proposes a Hybrid Genetic Algorithm (HGA) for the Resource Constrained Project Scheduling Problem (RCPSP). Resources are renewable and there is a unique way to perform the activities. This work employs Genetics Algorithms (GA) and Hybrid Genetic Algorithms to schedule project activities to minimize makespan subject to precedence constraints and resources availability. The algorithms ...

One of the foremost techniques in the design and analysis of approximation algorithms is to round the optimal solution to a linear programming relaxation in order to compute a near-optimal solution to the problem at hand. We shall survey recent work in this vein for two particular problems: the uncapacitated facility location problem and the problem of scheduling precedence-constrained jobs on ...