Computing Redundant Resources for the RCPSP
نویسندگان
چکیده
Several efficient lower bounds for the Resource Constrained Project Scheduling Problem (RCPSP) have been proposed recently. Some of them are based on the notion of redundant resource. In this paper we define a redundant function as an application f: [0, B] →[0, B’] such that i1 + i2 + ...+ik ≤ B implies f(i1) + f(i2) +...+ f(ik) ≤ B’. Then we explain that redundant functions are very useful for computing redundant resources. We also describe an algorithm for computing all maximal redundant functions. Computational results are reported.
منابع مشابه
Estimation of absolute error for the resources-constrained project scheduling problem
We consider some special cases of the NP -hard resource-constrained project scheduling problem (RCPSP ) to minimize the makespan. We conjecture that the ratio of the optimal makespan of RCPSP to that of the preemptive version of the problem is less than 2. We show that a well-known lower bounds for the problem may yield bad approximation ratios or its calculation is an NP -hard problem too. We ...
متن کاملA Genetic Algorithm for the Resource Constrained Project Scheduling Problem (rcpsp)
This paper proposes a Genetic Algorithm 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 to schedule project activities to minimize makespan subject to precedence constraints and resources availability. A serial generation scheme is used to obtain the schedule. The ...
متن کاملA greedy heuristic approach for the Resource-Constrained Project Scheduling Problem
We consider the resource constrained project scheduling problem (RCPSP) with precedence. All resources are renewable and the objective is to find a schedule that meets all resource and precedence constraints and minimizes the makespan. We propose a heuristic deterministic greedy algorithm solving this problem with the time complexity depending on the number of activities as n log n. The main id...
متن کاملImproving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in real life production processes and subsumes open-shop, job-shop, and flow-shop scheduling as special cases. We here present an application of machine learning to adapt simple greedy strategies for the RCPSP. Iterative re...
متن کاملAn Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing as precedence constraints the so called “Feeding Precedences” (FP). For the RCPSP with FP we propose a new mathematical formulation and a branch and bound algorithm exploiting the latter formulation. The exact algorithm takes advantage also of a lower...
متن کامل