Login

Welcome, Guest. Please login or register.

November 01, 2025, 10:15:26 am

Author Topic: networks-project crashing  (Read 2207 times)  Share 

0 Members and 1 Guest are viewing this topic.

Albeno69

  • Victorian
  • Forum Leader
  • ****
  • Posts: 746
  • Respect: +2
networks-project crashing
« on: August 30, 2010, 07:12:27 pm »
0
i struggle to get a handle of this concept i understand the critical path EST and LST but dont understand how crashing works. can anyone help me,

crayolé

  • Victorian
  • Forum Leader
  • ****
  • Posts: 788
  • Respect: +3
Re: networks-project crashing
« Reply #1 on: August 30, 2010, 07:59:41 pm »
0
Project crashing involves lowering the duration of events in the critical path which will change the earliest/latest starting times.

In the exam, you'll be given a list of events that can have their time lowered. All you have to do is use those instead of the normal times and redo the EST/LST. Which may or may not result in a new critical path (most of the time it will)

LFTM

  • Victorian
  • Part of the furniture
  • *****
  • Posts: 1072
  • Respect: +1
Re: networks-project crashing
« Reply #2 on: September 05, 2010, 11:05:24 pm »
0
Can someone please explain crashing in more depth, i don't get it and the essentials book barely covers it,

TIA

_avO

  • Victorian
  • Part of the furniture
  • *****
  • Posts: 1915
  • Respect: +15
Re: networks-project crashing
« Reply #3 on: September 05, 2010, 11:19:52 pm »
0
Yea I use Essentials and I find it's really pathetic in terms of explaining chapter 24 (looks like it was rushed).

Basically crashing is when a business wants to become more efficient in its operations (maybe by employing another worker or making workers work more productively) which will generally mean an increase in costs. What crashing does is that it lowers the duration of a particular stage in the process of producing a good. Crashing can only be used on paths that are within the critical path. The point of crashing is to see whether it is more or less efficient after determining its effects.

e.g. lets say A to B usually took 10 days, but now it takes 8 after crashing. Assuming A is the beginning of the critical path and B is next in the line (Critical path = A-B-D-F-G). You basically alter the [EST|LST] of B (given that it's only predecessor is A) down 2, making it [8|8] instead of [10|10]. In the end, the finishing time will be reduced by 2 days from [X|X] to [X-2|X-2]

Using the above example, lets alter it and say another path A to C (Where C is a predecessor of E only) takes 9 days. The new critical path can now be seen as A-C-E-F-G. Thus when writing out the [EST|LST] B will be altered from [8|8] to [8|?] and C will be altered from [9|?] to [9|9]. Because of the crashing of the path A to B, it has actually caused the critical path to change and hence you can say that it was not efficient to crash A to B since B is no longer in the critical path wasting business costs and floating the process.

This is basically what I think crashing is just from looking at the Essentials textbook. If anyone sees anything incorrect about this please address it
« Last Edit: September 05, 2010, 11:33:36 pm by _avO »
2011-2014: Bachelor of Commerce/Economics @ Monash Clayton

LFTM

  • Victorian
  • Part of the furniture
  • *****
  • Posts: 1072
  • Respect: +1
Re: networks-project crashing
« Reply #4 on: September 06, 2010, 03:56:09 pm »
0
Thanks. How do you know how much to crash it by?

crayolé

  • Victorian
  • Forum Leader
  • ****
  • Posts: 788
  • Respect: +3
Re: networks-project crashing
« Reply #5 on: September 06, 2010, 09:59:27 pm »
0
Thanks. How do you know how much to crash it by?
It'll be in the question stem. You'll get a table telling you how much each event can be lowered by