Solving Scheduling Problem: Probability of Completing Projects A and B at Time t

  • Thread starter Jimmy Snyder
  • Start date
  • Tags
    Scheduling
In summary: Therefore, the probability p_{ab}(t) for t_1 + t_3 \leq t \leq t_2 + t_4 can be calculated by plugging in the given values for t_1, t_2, t_3, and t_4 in the respective equations for p_a(t) and p_b(t). In summary, the probability that both projects, a and b, will be completed at time t is a linear function of t and can be calculated by multiplying the individual probabilities of each project being completed by time t.
  • #1
Jimmy Snyder
1,127
21
The probability that project a will be complete at time t after it begins is given as:

[tex]
\[ p_a(t) = \left\{ \begin{array}{ll}
0 & \mbox{if t \leq t_1$} \\
\frac {(t - t_1)}{t_2-t_1} & \mbox{if t_1 \leq t \leq t_2$} \\
1 & \mbox{if t_2 \leq t}
\right. \][/tex]

In other words, the project requires at least [itex]t_1[/itex] to complete and will take no more than [itex]t_2[/itex]. The probability of completion at any time between [itex]t_1[/itex] and [itex]t_2[/itex] is a linear function of t.

The probability that project b will be complete at time t after it begins is given as:
[tex]
\[ p_b(t) = \left\{ \begin{array}{ll}
0 & \mbox{if t \leq t_3$} \\
\frac {(t - t_3)}{t_4-t_3} & \mbox{if t_3 \leq t \leq t_4$} \\
1 & \mbox{if t_4 \leq t}
\right. \][/tex]


Project b will begin the moment project a is complete. Given t, what is the probability [itex]p_{ab}(t)[/itex] that both projects will be complete at time t. Obviously,
[tex]
\[ p_{ab}(t) = \left\{ \begin{array}{ll}
0 & \mbox{if t \leq t_1 + t_3$} \\
1 & \mbox{if t_2 + t_4 \leq t}
\right. \][/tex].

What is [itex]p_{ab}(t)[/itex] for [itex]t_1 + t_3 \leq t \leq t_2 + t_4[/itex]?
 
Physics news on Phys.org
  • #2
In this case, the probability that both projects will be completed at time t is the product of the probabilities that each project will be completed by time t: \[p_{ab}(t) = p_a(t-t_3) \cdot p_b(t-t_1)\]
 
  • #3


To calculate p_{ab}(t) for t_1 + t_3 \leq t \leq t_2 + t_4, we need to consider the overlap between the probabilities of project a and project b completing at time t. This can be visualized as the shaded area in the graph below:

[insert graph here]

The shaded area represents the probability of both projects a and b completing at time t. It can be calculated by finding the minimum of the two probabilities at each time t within the range t_1 + t_3 \leq t \leq t_2 + t_4.

Therefore, p_{ab}(t) for t_1 + t_3 \leq t \leq t_2 + t_4 can be calculated as:

\[ p_{ab}(t) = \left\{ \begin{array}{ll}
0 & \mbox{if t \leq t_1 + t_3$} \\
\min \{p_a(t), p_b(t)\} & \mbox{if t_1 + t_3 \leq t \leq t_2 + t_4$} \\
1 & \mbox{if t_2 + t_4 \leq t}
\right. \]

In other words, p_{ab}(t) will be equal to the minimum of p_a(t) and p_b(t) within the range t_1 + t_3 \leq t \leq t_2 + t_4. This means that if either project a or project b has a lower probability of completion at time t, then the overall probability of both projects being completed at that time will be equal to that lower probability.

Overall, this approach allows us to calculate the probability of both projects being completed at any given time t, taking into account the overlap between their individual completion probabilities.
 

FAQ: Solving Scheduling Problem: Probability of Completing Projects A and B at Time t

What is a scheduling problem?

A scheduling problem is a type of optimization problem where a set of tasks or projects need to be completed within a certain time frame, while taking into consideration constraints such as resource availability and dependencies between tasks.

What is the probability of completing Projects A and B at Time t?

The probability of completing Projects A and B at Time t depends on various factors such as the complexity of the projects, availability of resources, and potential delays. It can be calculated by using mathematical models and simulations to estimate the likelihood of completing both projects within the given time frame.

What are some techniques for solving scheduling problems?

There are various techniques that can be used to solve scheduling problems, such as linear programming, dynamic programming, and heuristic algorithms. These techniques involve using mathematical models and algorithms to find the optimal scheduling solution.

How can uncertainties be accounted for in solving scheduling problems?

Uncertainties, such as unexpected delays or changes in resource availability, can be accounted for by incorporating probabilistic models and simulations in the scheduling process. This allows for a more realistic assessment of the probability of completing projects at a given time.

What are the benefits of solving scheduling problems?

Solving scheduling problems can lead to more efficient and effective use of resources, reduced project delays, and improved project outcomes. It can also help with decision-making and resource allocation for future projects.

Similar threads

Back
Top