Problem involving Earliest Start Times in this Activity Network

  • Context: Comp Sci 
  • Thread starter Thread starter chwala
  • Start date Start date
  • Tags Tags
    Activity
Click For Summary

Discussion Overview

The discussion revolves around calculating earliest start times (EST) and late finish times in an activity network, particularly focusing on project duration and the implications of delays in specific activities. Participants are working through a problem related to project management and scheduling, with references to exam mark schemes and personal interpretations of the calculations involved.

Discussion Character

  • Homework-related
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant notes that EST is the earliest time an activity can start, considering all dependencies, and presents a calculation involving multiple activities.
  • Another participant questions the early start time entered by the first participant, suggesting an alternative path that allows for a different start time.
  • A participant clarifies that their previous working was a copy from an exam mark scheme, indicating a misunderstanding of the question.
  • There is a discussion about calculating the maximum number of days an activity can be delayed without affecting the project's completion time, with specific calculations for earliest and latest start times presented.
  • Participants express differing preferences for the representation of activity networks, with one preferring "activity on node" networks for clarity.

Areas of Agreement / Disagreement

Participants do not fully agree on the correct early and late start times for activity H, with some corrections and clarifications being made. The discussion remains unresolved regarding the maximum delay for activity H and the implications of different representations of the activity network.

Contextual Notes

There are references to specific calculations and interpretations that may depend on the definitions used for early and late start times, as well as the format of the activity network. Some assumptions about the project duration and dependencies are not explicitly stated.

chwala
Gold Member
Messages
2,828
Reaction score
425
Homework Statement
Kindly consider the attached diagram and its solution.
Relevant Equations
decision maths
1741388694875.png

Now the steps seem to be pretty clear on this ms below;
1741388749493.png



My challenge is on the highlighted, in short i note that EST is the earliest time that an activity can start. No challenge on that and by that we have to consider all dependencies. Now i can note that we have,
##B(7) + D(4) + E(5) + J(7) = 23##
##23 + K(5) =28##

that aspect is clear with me as also applies to other nodes. Now my question is the ##30## how to arrive at that? this is a new area to me but i have taken the challenge to self study.
Cheers.


aaaaaah late event time...i should be able to master that! from final node i can see that going backwards we have ##33-3=30## ...if that is correct then i will proceed.
 
Last edited:
Physics news on Phys.org
chwala said:
from final node i can see that going backwards we have ##33-3=30## ...if that is correct then i will proceed.

Yes, that is the correct way to enter the late finish times, but why have you entered 11 as the early start time in the top left box? There is a different path that allows this event to start at t = 5. That is not the only error you have made.
 
  • Like
Likes   Reactions: chwala
That is not my working but a copy of mark scheme from one of the international exam boards...
 
  • Informative
Likes   Reactions: pbuk
chwala said:
That is not my working but a copy of mark scheme from one of the international exam boards...

Ah, I have misinterpreted the question, let me have another look.
 
Sorry, I was thrown by the format. The answer is correct, as is your comment
chwala said:
from final node i can see that going backwards we have ##33-3=30## ...if that is correct then i will proceed.

Silly me o:)
 
  • Like
Likes   Reactions: chwala
...just to get this clear. The project will take 33 days, correct. Now to my question, Calculate the maximum number of days by which activity H could be delayed without lengthening the completion time of the project?

My thinking; Earliest start ##9 +4 = 13##

Latest start ##27-4 = 23##

Therefore, Float = ##23-13=10##

on the contrary, if the question had asked for maximum number of days for activity H, where delayed in completing project is allowed, then how would we proceed? I guess ##79##
 
Last edited:
chwala said:
...just to get this clear. The project will take 33 days, correct.
Correct.

chwala said:
My thinking; Earliest start ##9 +4 = 13##
No, the early start (I prefer the terms 'late' and 'early' rather than 'latest' and 'earliest') for H is 9 (the top number in its predecessor node): 13 is the early finish for H.

chwala said:
Latest start ##27-4 = 23##

No, the late start for H is 23 - 4 = 19 (the late finish (the bottom number) for its successor node - H's duration).

I am not a fan of "activity on arrow" networks, particularly when times are shown on nodes. An "activity on node" (AON) network with ES, EF, LF and LS shown for each task is much easier to work with and to easily see the critical path(s) and the float for each activity.

chwala said:
on the contrary, if the question had asked for maximum number of days for activity H, where delayed in completing project is allowed, then how would we proceed? I guess ##79##
I don't understand what you are asking here.
 

Similar threads

  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 32 ·
2
Replies
32
Views
5K
  • · Replies 21 ·
Replies
21
Views
3K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K