Pages that link to "Item:Q1278225"

The following pages link to On the use of the complexity index as a measure of complexity in activity networks (Q1278225):

Displaying 23 items.

• An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem (Q296973) (← links)
• Event-based MILP models for resource-constrained project scheduling problems (Q709100) (← links)
• On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems (Q781900) (← links)
• The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
• A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
• A random generator of resource-constrained multi-project network problems (Q964864) (← links)
• An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations (Q1265850) (← links)
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation (Q1266547) (← links)
• DAGEN: A generator of testsets for project activity nets (Q1266552) (← links)
• PSPLIB -- a project scheduling problem library (Q1278481) (← links)
• Activity nets: A guided tour through some recent developments (Q1388902) (← links)
• Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
• Measuring flexibility in software project schedules (Q1637880) (← links)
• New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← links)
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling (Q1806914) (← links)
• Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
• A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
• The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic (Q2260900) (← links)
• Going to the core of hard resource-constrained project scheduling instances (Q2664304) (← links)
• An analysis of network and resource indicators for resource-constrained project scheduling problem instances (Q2668709) (← links)
• A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem (Q5870371) (← links)
• A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem (Q6106590) (← links)
• Continuous-time formulations for multi-mode project scheduling (Q6164343) (← links)