BU275 Study Guide - Final Guide: Poisson Point Process, Goal Programming, Exponential Distribution
Document Summary
Same thing as picture above ^^ but with. Arrival time = prev customer arrival time + current (arrival clock) person"s interarrival time. Enter facility clock = max (arrival clock, dep. time prev cust) Waiting time = enter facility clock arrival time. Dep time = enter facility clock + service duration. Time in system = dep time arrival clock. Idle time = enter facility clock = dep prev cust. Total idle time = simulation length total busy time. Utilization rate = sum of service time / (sum of service time+ sum of idle time) Quantity sold = min( quantity sold, demand of product) Queues arise when st dem for service > capacity. Chance of arrival in next min = same. Prob of arrival in next min = uninfluenced by when las arrival occurred. Capacity: queue discipline (sched policy) : order in which members of queue selected to begin service. = expect # of service completions per unit for single server customers.
