On the use of the complexity index as a measure of complexity in activity networks
From MaRDI portal
Publication:1278225
DOI10.1016/0377-2217(94)00344-0zbMath0924.90092OpenAlexW1978516157MaRDI QIDQ1278225
De Reyck, Bert, Willy S. Herroelen
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/lkcsb_research/6738
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (24)
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 ⋮ Measuring flexibility in software project schedules ⋮ A reduction tree approach for the discrete time/cost trade-off problem ⋮ 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 ⋮ A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem ⋮ Continuous-time formulations for multi-mode project scheduling ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Case-based reasoning and improved adaptive search for project scheduling ⋮ A random generator of resource-constrained multi-project network problems ⋮ The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic ⋮ 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 ⋮ Complexity indices for the multidimensional knapsack problem ⋮ Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling ⋮ An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations ⋮ Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation ⋮ DAGEN: A generator of testsets for project activity nets ⋮ PSPLIB -- a project scheduling problem library ⋮ On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems ⋮ A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the measurement of complexity in activity networks
- Feature issue: Project management and scheduling. 4th international workshop organized by the EURO working group. Leuven, Belgium, July 12--15, 1994
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Coefficient of Network Complexity
- Project scheduling: The effects of problem structure on heuristic performance
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
- On the minimum dummy-arc problem
- A Random Activity Network Generator
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
This page was built for publication: On the use of the complexity index as a measure of complexity in activity networks
