On the measurement of complexity in activity networks
type: Item
instance of: scholarly article
title: On the measurement of complexity in activity networks
zbMATH Open document ID: 0444.90049
DOI: 10.1016/0377-2217(80)90053-3
author: Salah E. Elmaghraby
author: Willy Herroelen
published in: European Journal of Operational Research
publication date: 1980-01-01T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/494168
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3694919
zbMATH Keywords: network complexity
zbMATH Keywords: complexity measurement
zbMATH Keywords: activity networks complexity
zbMATH Keywords: project scheduling
MaRDI profile type: Publication
OpenAlex ID: W2080255019
cites work: Optimal Linear Ordering
cites work: Q4091421
cites work: Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
cites work: Q3293216
cites work: Q4131987
cites work: Q4769056
cites work: Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
cites work: An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
cites work: Q4166568
cites work: DAGEN: A generator of testsets for project activity nets
cites work: Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
cites work: Q4103293
cites work: Coefficient of Network Complexity
cites work: Q4062176
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Q4130999
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Q5631120
cites work: Q4194705
cites work: An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
cites work: A method and two algorithms on the theory of partitions
cites work: Project scheduling: The effects of problem structure on heuristic performance
cites work: Q5580836
cites work: On general routing problems
cites work: Q3243274
cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
cites work: Measures of the restrictiveness of project networks
cites work: Q4137124
description: scientific article; zbMATH DE number 3694919