A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
type: Item
instance of: scholarly article
title: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
zbMATH Open document ID: 1012.90513
DOI: 10.1016/S0377-2217(02)00136-4
author: Roland Heilmann
published in: European Journal of Operational Research
publication date: 2003-04-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 1896731
zbMATH Keywords: project management and scheduling
zbMATH Keywords: branch-and-bound
zbMATH Keywords: resource-constrained
zbMATH Keywords: multi-mode
zbMATH Keywords: maximum time lags
MaRDI profile type: Publication
cites work: Q3468865
cites work: A branch and bound algorithm for the resource-constrained project scheduling problem
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: The multi-mode resource-constrained project scheduling problem with generalized precedence relations
cites work: A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
cites work: Q4166568
cites work: Q4130999
cites work: Q4693179
cites work: Active and stable project scheduling
cites work: DSS for multiobjective project scheduling
cites work: Resource-constrained project scheduling. Exact methods for the multi-mode case
cites work: Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
cites work: An exact algorithm for project scheduling with multiple modes
description: scientific article; zbMATH DE number 1896731