On the measurement of complexity in activity networks

DOI10.1016/0377-2217(80)90053-3zbMath0444.90049OpenAlexW2080255019MaRDI QIDQ1145062

Salah E. Elmaghraby, Willy S. Herroelen

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/494168

zbMATH Keywords

project schedulingnetwork complexityactivity networks complexitycomplexity measurement

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items

The discrete time/cost trade-off problem: Extensions and heuristic procedures, An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem, Optimal resource leveling using non-serial dynamic programming, A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs, Going to the core of hard resource-constrained project scheduling instances, An analysis of network and resource indicators for resource-constrained project scheduling problem instances, Activity nets: A guided tour through some recent developments, Continuous-time formulations for multi-mode project scheduling, Resource-constrained project scheduling: A survey of recent developments., A new method for constructing a minimal PERT network, An evaluation of the adequacy of project network generators with systematically sampled networks, A heuristic procedure for solving the dynamic probabilistic project expediting problem, A random generator of resource-constrained multi-project network problems, Event-based MILP models for resource-constrained project scheduling problems, New computational results for the discrete time/cost trade-off problem with time-switch constraints, The multi-mode resource-constrained project scheduling problem with generalized precedence relations, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, Optimal procedures for the discrete time/cost trade-off problem in project networks, On the characterization and generation of nurse scheduling problem instances, On the use of the complexity index as a measure of complexity in activity networks, Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method and two algorithms on the theory of partitions
• DAGEN: A generator of testsets for project activity nets
• Coefficient of Network Complexity
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Project scheduling: The effects of problem structure on heuristic performance
• Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
• Measures of the restrictiveness of project networks
• On general routing problems
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimal Linear Ordering
• Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
• An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
• Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints