1 / 24

The production inventory problem

The production inventory problem. What is the expected inventory level? What is expected backorder level? What is the expected total cost? What is the optimal base-stock level?. Three basic processes. I : level of finished goods inventory B : number of backorders (backorder level)

katelyn-malone
Download Presentation

The production inventory problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The production inventory problem • What is the expected inventory level? • What is expected backorder level? • What is the expected total cost? • What is the optimal base-stock level?

  2. Three basic processes I: level of finished goods inventory B: number of backorders (backorder level) IO: inventory on order.

  3. Three basic processes Under a base-stock policy, the arrival of each customer order triggers the placement of an order with the production system  s = I + IO – B  s = E[I] + E[IO] – E[B]

  4. Three basic processes I and B cannot be positive at the same time  I = max(0, s - IO) = (s – IO)+ E[I] = E[(s – IO)+]  B = max(0, IO - s) = (IO - s)+  E[B] = E[(IO - s)+]

  5. The production system behaves like an M/M/1 queue, with IO corresponding to the number of customers in the system.

  6. Expected backorder level

  7. Expected inventory level

  8. Expected cost

  9. Optimal base-stock level

  10. Optimal base-stock level

  11. Queueing Theory

  12. The study of queues – why they form, how they can be evaluated, and how they can be optimized. Building blocks – arrival process and a service process.

  13. Some characteristics of arrival and service processes Arrival process – individually/in groups, independent/correlated, single source/multiple sources, infinite/finite population, limited/unlimited capacity. Service process – single/multiple servers, single/multiple stages, individually/in groups, independent/correlated, service discipline (FCFS/priority).

  14. A Common notation GX/GY/k/N N: maximum number of customers allowed G: distribution of inter-arrival times G: distribution of service times k: number of servers X: distribution of arrival batch (group) size Y: distribution of service batch size

  15. Common examples M/M/1 M/G/1 M/M/k M/M/1/N MX/M/1 GI/M/1 M/M/k/k

  16. Fundamental quantities L: expected number of customers in the system, L =E(n). LQ: expected number of customers waiting in queue. W: expected time a customer spends in the system. WQ: expected time a customer spends waiting in queue E[S]: expected time customer spends in service. l: customer arrival rate, l = limt ∞N(t)/t, where N(t) is the number of arrivals up to time t.

  17. Fundamental relationships L = LQ + Ns W = WQ + E(S) L = lW LQ = lWQ Ns = lE(S) The relationship L = lW is often referred to as Little’s law.

  18. A heuristic proof Number in system 3 2 1 t1 t2t3 t4 t5 t6 t7 T

  19. L = [1(t2-t1)+2(t3-t2)+1(t4-t3)+2(t5-t4)+3(t6-t5)+2(t7-t6)+1(T-t7)]/T = (area under curve)/T = (T+t7+t6-t5-t4+t3-t2-t1)/T W = [(t3-t1)+(t6-t2)+(t7-t4)+(T-t5)]/4 = (T+t7+t6-t5-t4+t3-t2-t1)/4 = (area under curve)/N(T)

  20. L = (area under curve)/T, W = (area under curve)/N(T) LT=WN(T) L=WN(T)/T Since as T∞, N(T)/T l, L= lW as T∞. A similar heuristic proof can be used to show LQ = lWQ and Ns = lE(S).

  21. L = (area under curve)/T, W = (area under curve)/N(T) LT=WN(T) L=WN(T)/T Since as T∞, N(T)/T l, L= lW as T∞. A similar heuristic proof can be used to show LQ = lWQ and Ns = lE(S).

  22. For a single server queue:

  23. Why do queues form? • Case 1 • Customers arrive at regular & constant intervals • Service times are constant • Arrival rate < service rate (l< m) • WQ = 0 • W = WQ + E(S) = E(S) • L = lW = lE(S) • WQ = lWQ = 0 • TH (output rate) = l

  24. Why do queues form? • Case 1 • Customers arrive at regular & constant intervals • Service times are constant • Arrival rate < service rate (l< m) • WQ = 0 • W = WQ + E(S) = E(S) • L = lW = lE(S) • WQ = lWQ = 0 • TH (output rate) = l

More Related