Measures of the restrictiveness of project networks
From MaRDI portal
Publication:4142985
DOI10.1002/NET.3230070302zbMATH Open0366.90057OpenAlexW2132006551MaRDI QIDQ4142985FDOQ4142985
Authors: Arne Thesen 
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070302
Cites Work
Cited In (13)
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- A random generator of resource-constrained multi-project network problems
- On the summary measures for the resource-constrained project scheduling problem
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
- MIP models for resource-constrained project scheduling with flexible resource profiles
- On the measurement of complexity in activity networks
- Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
- Optimizing the supply chain configuration for make-to-order manufacturing
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
This page was built for publication: Measures of the restrictiveness of project networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4142985)
