Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources

2011 ◽  
Author(s):  
Ali Shirzadeh Chaleshtarti ◽  
Shahram Shadrokh
Keyword(s):  
Branch And Bound ◽  
Project Scheduling ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Resource Constrained Project Scheduling ◽  
Branch And Bound Algorithms ◽  
Project Scheduling Problem

scholarly journals Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
A. Shirzadeh Chaleshtarti ◽  
S. Shadrokh ◽  
Y. Fathi
Keyword(s):  
Branch And Bound ◽  
Project Scheduling ◽  
Real Life ◽  
Scheduling Problem ◽  
Nonrenewable Resources ◽  
Resource Constrained ◽  
Resource Constrained Project Scheduling ◽  
Branch And Bound Algorithms ◽  
Project Scheduling Problem ◽  
The Difference

A lot of projects in real life are subject to some kinds of nonrenewable resources that are not exactly similar to the type defined in the project scheduling literature. The difference stems from the fact that, in those projects, contrary to the common assumption in the project scheduling literature, nonrenewable resources are not available in full amount at the beginning of the project, but they are procured along the project horizon. In this paper, we study this different type of nonrenewable resources. To that end, we extend the resource constrained project scheduling problem (RCPSP) by this resource type (RCPSP-NR) and customize four basic branch and bound algorithms of RCPSP for it, including precedence tree, extension alternatives, minimal delaying alternatives, and minimal forbidden sets. Several bounding and fathoming rules are introduced to the algorithms to shorten the enumeration process. We perform comprehensive experimental analysis using the four customized algorithms and also CPLEX solver.

scholarly journals A branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP)

DYNA ◽  
2015 ◽  
Vol 82 (190) ◽  
pp. 198-207 ◽  
Author(s):  
Daniel Morillo Torres ◽  
Luis Fernando Moreno Velasquez ◽  
Francisco Javier Díaz Serna
Keyword(s):  
Branch And Bound ◽  
Project Scheduling ◽  
Search Tree ◽  
Feasible Region ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Resource Constrained ◽  
Basic Algorithm ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

This paper addresses the Resource Constrained Project Scheduling Problem (RCPSP). For its solution, a hybrid methodology, which uses a Branch and Bound basic algorithm with dominance rules, is developed and implemented, and is combined with four deterministic heuristics whose objective is to prune the search tree branches, taking into account the iterations available and, at the same time, to minimize the probability of discarding branches that contain optimal solutions. Essentially, these strategies allow the allocation of most iterations to the most promissory regions in an organized manner using only subsets with similar or the same characteristics as those of the optimal solutions at each level of the tree, thus assuring a broad search within the feasible region and, simultaneously, a good exploitation by the selective use of the subsets by level. Finally, the developed algorithm performance is analyzed by solving some of the problems of the PSPLIB test library.

scholarly journals A Branch and Bound Approach to Solve the Preemptive Resource Leveling Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Behrouz Afshar-Nadjafi ◽  
Zeinab Khalaj ◽  
Esmaeil Mehdizadeh
Keyword(s):  
Objective Function ◽  
Branch And Bound ◽  
Project Scheduling ◽  
Branch And Bound Algorithm ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Additional Time ◽  
Resource Leveling ◽  
Branch And Bound Algorithms ◽  
Project Scheduling Problem

We study resource constrained project scheduling problem with respect to resource leveling as objective function and allowance of preemption in activities. The branch and bound algorithms proposed in previous researches on resource leveling problem do not consider preemption. So, representing a model for the problem, a branch and bound algorithm is proposed. This algorithm can handle preemption in resource leveling problem. Comparing the resource leveling problem and the preemptive resource leveling problem, it is observed that considering preemption in the problem leads to better results in the objective function. This improvement imposes additional time to solve the problem. Coding the algorithm in MATLAB and checking it on the projects with 8 and 10 activities, results show that the proposed algorithm is efficient.

Sign in / Sign up

Export Citation Format

Share Document