Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
type: Item
instance of: scholarly article
title: Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
zbMATH Open document ID: 1407.90174
DOI: 10.1155/2014/634649
author: A. Shirzadeh Chaleshtarti
author: Shahram Shadrokh
author: Yahya Fathi
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7016903
Wikidata QID: Q57424079
describes a project that uses: CPLEX
describes a project that uses: MPSPLib
describes a project that uses: ILOG SCHEDULE
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1155/2014/634649
OpenAlex ID: W2033690669
cites work: Project Scheduling Under Partially Renewable Resource Constraints
cites work: An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags
cites work: Resource-constrained project scheduling through the goal programming model: integration of the manager's preferences
cites work: A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
cites work: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
cites work: Experimental investigation of heuristics for resource-constrained project scheduling: an update
cites work: A survey of variants and extensions of the resource-constrained project scheduling problem
cites work: Project scheduling with finite or infinite number of activity processing modes -- a survey
cites work: Differential evolution for solving multi-mode resource-constrained project scheduling problems
cites work: A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
cites work: Q3859552
cites work: A Dynamic Programming Algorithm for Decision CPM Networks
cites work: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
cites work: Project scheduling. A research handbook.
cites work: Allocation of partially renewable resources: Concept, capabilities, and applications
cites work: A scatter search algorithm for project scheduling under partially renewable resources
cites work: GRASP and path relinking for project scheduling under partially renewable resources
cites work: A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Preselective strategies for the optimization of stochastic project networks under resource constraints
Recommended article: A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
Recommended article: A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
Recommended article: A branch-and-bound algorithm for the resource-constrained project scheduling problem
Recommended article: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
Recommended article: A branch and bound algorithm for the resource-constrained project scheduling problem
Recommended article: A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
Recommended article: Q3989344
Recommended article: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
Recommended article: A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
Recommended article: A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
description: scientific article; zbMATH DE number 7016903