A branch and bound algorithm for project scheduling problem with discounted cash flows

2016 ◽  
Vol 2 (3) ◽  
pp. 233
Author(s):  
Alican Comert ◽  
Meral Azizoglu
Keyword(s):  
Branch And Bound ◽  
Project Scheduling ◽  
Cash Flows ◽  
Branch And Bound Algorithm ◽  
Scheduling Problem ◽  
Project Scheduling Problem

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.

A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource

2020 ◽  
Vol 11 (2) ◽  
pp. 1-14
Author(s):  
Cansu Altintas ◽  
Meral Azizoglu
Keyword(s):  
Branch And Bound ◽  
Project Scheduling ◽  
Renewable Resource ◽  
Branch And Bound Algorithm ◽  
Scheduling Problem ◽  
Resource Requirement ◽  
Project Completion ◽  
Project Scheduling Problem ◽  
Problem Instances ◽  
Multi Mode

In this paper, a project scheduling problem with multi-modes and a single non-renewable resource is considered. The resource is released in pre-specified times at pre-specified quantities. An activity can be executed at different modes where a mode is defined by a processing time and a resource requirement amount. The objective is to minimize the project completion time. A branch and bound algorithm that enumerates the partial solutions based on the mode assignment decisions is presented. The results of the experiments have revealed that the branch and bound algorithm can solve problem instances with up to 100 activities in reasonable times.

scholarly journals A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Shicheng Hu ◽  
Song Wang ◽  
Yonggui Kao ◽  
Takao Ito ◽  
Xuedong Sun
Keyword(s):  
Branch And Bound ◽  
Project Scheduling ◽  
Simulation Experiment ◽  
Resource Constraints ◽  
Branch And Bound Algorithm ◽  
Scheduling Problem ◽  
Two Dimensional ◽  
Dominance Rule ◽  
Project Scheduling Problem ◽  
Maximal Space

With respect to the block assembly schedule in a shipbuilding enterprise, a spatial resource constrained project scheduling problem (SRCPSP) is proposed, which aims to minimize the makespan of a project under the constraints of the availability of a two-dimensional spatial resource and the precedence relationship between tasks. In order to solve SRCPSP to the optimum, a branch and bound algorithm (BB) is developed. For the BB-SRCPSP, first, an implicitly enumerative branch scheme is presented. Secondly, a precedence based lower bound, as well as an effective dominance rule, is employed for pruning. Next, a heuristic based algorithm is used to decide the order of a node to be selected for expansion such that the efficiency of the algorithm is further improved. In addition, a maximal space based arrangement is applied to the configuration of the areas required each day in an available area. Finally, the simulation experiment is conducted to illustrate the effectiveness of the BB-SRCPSP.

Sign in / Sign up

Export Citation Format

Share Document