SAN Duration

From SimOpt

Jump to: navigation, search
About the Problem
Reported Results
  • None.
Related Problems
  • None.
Problem Overview

Given a stochastic activity network, minimize the duration of the longest path from node a to node

  • minimize the duration of the longest path from node a to node i <math>f(\theta)= \sum_{i=1}^{13} \theta_i</math>

<math> \theta_i</math> being the mean duration on each arc

Comments
  • Problem Statmement edit: Sum in second paragraph should be from i=1 to 13, not i=1 to 9.
  • Suggest [1000; 10000; 30000; 100000] as budget.
  • Parallel-computing version.
References

Back to Simulation Optimization Library! |}
Personal tools
Namespaces
Variants
Actions
Navigation
Toolbox