A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
type: Item
instance of: scholarly article
title: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
zbMATH Open document ID: 0948.90077
DOI: 10.1016/S0377-2217(97)00305-6
published in: European Journal of Operational Research
publication date: 2000-11-27T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1338084
zbMATH Keywords: project management
zbMATH Keywords: critical path methods
zbMATH Keywords: branch-and-bound
zbMATH Keywords: generalized precedence relations
author: Bert De Reyck
author: Willy Herroelen
MaRDI profile type: Publication
cites work: Q3468865
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
cites work: New Benchmark Results for the Resource-Constrained Project Scheduling Problem
cites work: A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
cites work: Q4166568
cites work: The scheduling of activities to maximize the net present value of projects
cites work: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
cites work: The payment scheduling problem
cites work: Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
cites work: Project network models with discounted cash flows a guided tour through recent developments
cites work: A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: Q4130999
cites work: Application of a Technique for Research and Development Program Evaluation
cites work: An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
cites work: Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
cites work: Cash Flows in Networks
cites work: One-machine generalized precedence constrained scheduling problems
cites work: Heuristics for scheduling resource-constrained projects in MPM networks
Wikidata QID: Q126351477
full work available at URL: s0377-2217(97)00305-6
OpenAlex ID: W2132709136
Recommended article: A Branch-and-Bound Procedure for the Generalized 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 new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
Recommended article: The multi-mode resource-constrained project scheduling problem with generalized precedence relations
Recommended article: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
Recommended article: A branch-and-bound algorithm for the resource-constrained project scheduling problem
Recommended article: A branch and bound algorithm for the resource-constrained project scheduling problem
Recommended article: A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
Recommended article: A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
description: scientific article; zbMATH DE number 1338084