Measures of the restrictiveness of project networks

DOI10.1002/net.3230070302zbMath0366.90057OpenAlexW2132006551MaRDI QIDQ4142985

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

MIP models for resource-constrained project scheduling with flexible resource profiles, Optimizing the supply chain configuration for make-to-order manufacturing, On the measurement of complexity in activity networks, A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints, A heuristic procedure for solving the dynamic probabilistic project expediting problem, A random generator of resource-constrained multi-project network problems, Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations, ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions, A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem, Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing

Cites Work

• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph