Professional Documents
Culture Documents
Determining the Critical Path: describe each steps with your examples
Step 1: Make a forward pass through the network as follows: For each activity i beginning at
the Start node, compute:
– Earliest Start Time = the maximum of the earliest finish times of all activities
immediately preceding activity i. (This is 0 for an activity with no predecessors.)
The project completion time is the maximum of the Earliest Finish Times at the Finish node.
For example, as we see from the picture the earliest start time for activity D is zero.
And earliest finish time for Activity D is 0+4 equal 4 days.
• Step 2: Make a backwards pass through the network as follows: Move sequentially backwards
from the Finish node to the Start node. At a given node, j, consider all activities ending at node
j. For each of these activities, i, compute:
– Latest Finish Time = the minimum of the latest start times beginning at node j. (For
node N, this is the project completion time.)
For example, as we see from the picture the latest finish time for activity D is 5 days.
And latest start time for Activity D is 5-4= 1 day.
Patient
– Customers enter the waiting line and remain until served
Balking occurs when the customer decides not to enter the waiting line. For
example, you see that there are already 12 students waiting to meet with your
professor, so you choose to come back later. Reneging occurs when the customer
enters the waiting line but leaves before being serviced. For example, you enter the
line waiting to meet with your professor, but after waiting 15 minutes and seeing
little progress, you decide to leave. Jockeying occurs when a customer changes
from one line to another, hoping to reduce the waiting time. A good example of
this is picking a line at the grocery store and changing to another line in the hope
of being served quicker. The models used in this supplement assume that
customers are patient.
1) The number of
The average number of customers waiting in line and in the system.
customers waiting in line can be interpreted in several ways. Short waiting
lines can result from relatively constant customer arrivals (no major surges
in demand) or from the organization’s having excess capacity (many
cashiers open). On the other hand, long waiting lines can result from poor
server efficiency, inadequate system capacity, and/or significant surges in
demand. For example, cotton is sent to different factories and mills. It is the
producer’s liability to deliver the cotton at the collection centers of the
factories. He delivers it the cotton in trucks. However, there is only one
weighing machine, so the farmer has to wait for long to get his cotton
weighed and get the weight receipt, which is taken to the cashier to receive
his payment. There are one service counter and the average number of
arrivals be 40 trucks per hour. The rate of the servicing can be 50 trucks per
hour. Here, the average number of the trucks can be arrive per unit of the
time λ= 40. Average number of trucks can service per unit of time µ= 50.
Thus, Average number of trucks waiting in queue Lq= λ 2\µ*(µ-λ) =
402\50*(50-40) = 1600\500 = 3.2 trucks. 2)The average time customers
spend waiting, and the average time a customer spends in the system.
Customers often link long waits to poor-quality service. When long waiting
times occur, one option may be to change the demand pattern. Average time
a truck passed waiting in queue Wq= λ\µ*(µ-λ) = 40/500= 0.08 hours or 4.8
minutes. 3) The system utilization rate. Measuring capacity utilization shows
the percentage of time the servers are busy. Management’s goal is to have
enough servers to assure that waiting is within allowable limits but not so
many servers as to be cost inefficient. Average utilization of the system p=
λ/µ= 40\50= 0.8 or 80%.