Question: Problem No . 3 ( Event Scheduling time advance algorithm ) Marks 1 0 Different types of parts arrive at an automated machining center. The

Problem No.3(Event Scheduling time advance algorithm)
Marks 10
Different types of parts arrive at an automated machining center. The types of parts and their interarrival
time is random. The machining time is deterministic. However, it depends on the part type. Assuming
that the first part arrives at time t=0 when the machining center was idle:
a. Perform a hand simulation using time-advance-event-scheduling approach and stop the
simulation at t=30 minutes. (Use the interarrival and machining times given in the last two
rows of the table below.)
b. Calculate the average queue length and the utilization of the machining center.Events are:
Arrival (A)
Departure (D)
Stopping event (E)
Event Notices are:
(i,A,t) to represent an arrival event of part i to occur at future time t
(i,D,t) to represent a departure event of part i to occur at future time t
(E,30) to represent the simulation stop event future time 30
Machining is accomplished with FIFO discipline (parts have equal priority irrespective of their
types).
Problem No . 3 ( Event Scheduling time advance

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mechanical Engineering Questions!