A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
type: Item
instance of: scholarly article
title: A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
author: Rob Van Eynde
author: Mario Vanhoucke
published in: Mathematics of Operations Research
publication date: 2023-01-09T00:00:00Z
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7639665
zbMATH Keywords: resource-constrained project scheduling
zbMATH Keywords: instance complexity
zbMATH Keywords: partial orders
zbMATH Keywords: counting problems
describes a project that uses: PSPLIB
MaRDI profile type: Publication
full work available at URL: moor.2021.1237
OpenAlex ID: W4206913842
cites work: Counting linear extensions
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: An exact composite lower bound strategy for the resource-constrained project scheduling problem
cites work: Going to the core of hard resource-constrained project scheduling instances
cites work: Q5480660
cites work: On the use of the complexity index as a measure of complexity in activity networks
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: A simple linear time algorithm for cograph recognition
cites work: A survey of the algorithmic aspects of modular decomposition
cites work: A survey of variants and extensions of the resource-constrained project scheduling problem
cites work: Phase transitions in project scheduling
cites work: Resource-constrained project scheduling: A survey of recent developments.
cites work: Q4349924
cites work: Experimental investigation of heuristics for resource-constrained project scheduling: an update
cites work: PSPLIB -- a project scheduling problem library
cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
cites work: Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
cites work: Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
cites work: On the generation of circuits and minimal forbidden sets
cites work: Measures of the restrictiveness of project networks
cites work: An evaluation of the adequacy of project network generators with systematically sampled networks
DOI: 10.1287/MOOR.2021.1237
description: scientific article; zbMATH DE number 7639665