A multiple-tree search procedure for the resource-constrained project scheduling problem
type: Item
instance of: scholarly article
title: A multiple-tree search procedure for the resource-constrained project scheduling problem
zbMATH Open document ID: 0915.90153
DOI: 10.1016/0377-2217(94)00247-9
author: Wendell P. III Simpson
author: James H. Patterson
published in: European Journal of Operational Research
publication date: 1998-10-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1208626
zbMATH Keywords: project management
zbMATH Keywords: project scheduling
zbMATH Keywords: limited resource availability
zbMATH Keywords: multiple parallel processors
zbMATH Keywords: multiple resource constraints
zbMATH Keywords: multiple-tree search procedure
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00247-9
OpenAlex ID: W2061571733
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: Anomalies in parallel branch-and-bound algorithms
cites work: A Horizon-Varying, Zero-One Approach to Project Scheduling
cites work: A two-process implicit enumeration algorithm for the simple assembly line balancing problem
cites work: An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
description: scientific article; zbMATH DE number 1208626