A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem

DOI10.1287/moor.2021.1237OpenAlexW4206913842MaRDI QIDQ5870371

Mario Vanhoucke, Rob Van Eynde

Publication date: 9 January 2023

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2021.1237

zbMATH Keywords

resource-constrained project schedulingpartial orderscounting problemsinstance complexity

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Deterministic scheduling theory in operations research (90B35) Enumeration in graph theory (05C30)

Related Items (3)

A reduction tree approach for the discrete time/cost trade-off problem ⋮ Optimal \((0, 1)\)-matrix completion with majorization ordered objectives ⋮ Continuous-time formulations for multi-mode project scheduling

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of the algorithmic aspects of modular decomposition
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Counting linear extensions
• On the use of the complexity index as a measure of complexity in activity networks
• PSPLIB -- a project scheduling problem library
• Resource-constrained project scheduling: A survey of recent developments.
• An exact composite lower bound strategy for the resource-constrained project scheduling problem
• A simple linear time algorithm for cograph recognition
• On the generation of circuits and minimal forbidden sets
• Resource-constrained project scheduling: Notation, classification, models, and methods
• An evaluation of the adequacy of project network generators with systematically sampled networks
• Going to the core of hard resource-constrained project scheduling instances
• Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
• Phase transitions in project scheduling
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Measures of the restrictiveness of project networks
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem