The multiple resource constrained project scheduling problem: A breadth-first approach
type: Item
instance of: scholarly article
title: The multiple resource constrained project scheduling problem: A breadth-first approach
zbMATH Open document ID: 0938.90031
DOI: 10.1016/S0377-2217(97)00402-5
author: Terence Nazareth
author: Sanjay Verma
author: Subir Bhattacharya
author: Amitava Bagchi
published in: European Journal of Operational Research
publication date: 1999-11-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1358473
zbMATH Keywords: project scheduling
zbMATH Keywords: resource constraint
zbMATH Keywords: breadth-first search
zbMATH Keywords: best-first search
zbMATH Keywords: breadth-first tree search scheme
zbMATH Keywords: makespan
MaRDI profile type: Publication
cites work: Solving resource-constrained project scheduling problems by a* search
cites work: Scheduling subject to resource constraints: Classification and complexity
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: New Benchmark Results for the Resource-Constrained Project Scheduling Problem
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
full work available at URL: s0377-2217(97)00402-5
OpenAlex ID: W2010524853
description: scientific article; zbMATH DE number 1358473