Occupation queue size DD1 Constant arrivals constant duration

  • Slides: 14
Download presentation
Occupation / queue size D/D/1: Constant arrivals, constant duration. M/D/1: Exponential arrivals, constant duration.

Occupation / queue size D/D/1: Constant arrivals, constant duration. M/D/1: Exponential arrivals, constant duration. queue size 4 a 2 a a 0. 6 0. 8 0. 9 1 occupation rate

Arena experiments M/D/1 queues. D/D/1 queues. Tandem queues.

Arena experiments M/D/1 queues. D/D/1 queues. Tandem queues.

Assignment 2 Goal: obtain Arena knowledge. Modeling+experimenting. Various models are possible. Several modeling pitfalls.

Assignment 2 Goal: obtain Arena knowledge. Modeling+experimenting. Various models are possible. Several modeling pitfalls. Use of expression builder. Repeated test vs. "hold" block.

Modeling: parameter choice Problem definition Conceptual impl: Arena CPN Tools Modeling parameterization Validation Experiment

Modeling: parameter choice Problem definition Conceptual impl: Arena CPN Tools Modeling parameterization Validation Experiment Interpret

Modeling: parameters Parameters for a model obtained by a combination of - observations (direct

Modeling: parameters Parameters for a model obtained by a combination of - observations (direct / video recordings), - event logs (e. g. SAP): often interpretation needed, - interviews. Select a distribution that accords with theory and matches measured averages. Example: "create" block M measured arrivals in N time units; exponential distribution with intensity M / N.

DCT arrivals Import trace into spreadsheet. DCT trace: arrival 1 at 0. 00, 500

DCT arrivals Import trace into spreadsheet. DCT trace: arrival 1 at 0. 00, 500 at 687. 835. exp. , avg interarrival time 687. 835 / 499. Model should differentiate between B/F/BF trucks: three generators with three different intensities. Intensities may stay the same or fluctuate. first 108 B trucks 0 -265, next 108 265 -678 first 49 BF trucks 13 -363, next 49 368 -681 first 90 F trucks 1 -427, next 90 427 -686. There may be reasons for fluctuations (e. g. traffic); look for confirmation by interviews!

Arena input analyzer Trace file is imported into spreadsheet and sorted. Export selected data

Arena input analyzer Trace file is imported into spreadsheet and sorted. Export selected data to text file, which can be read by input analyzer. Example with interarrival times for B trucks. However, no variable-intensity exponential distribution. So, divide in subparts and analyze separately. Keep asking questions! Listen to answers given!

Processing times Inferring processing times from trace. Problem with assessing duration for steps needing

Processing times Inferring processing times from trace. Problem with assessing duration for steps needing resources. Suppose step needs a resource R. Job id 123 127 136 132 start B 8. 79 11. 26 13. 24 14. 87 Idle time of R in between? Look at predecessor job(s)! rdy B 10. 01 13. 10 14. 67 16. 25

Assess resource occupation Job id 123 127 136 132 rdy A 8. 58 11.

Assess resource occupation Job id 123 127 136 132 rdy A 8. 58 11. 13 12. 09 13. 12 start B 8. 79 11. 26 13. 24 14. 87 rdy B 10. 01 13. 10 14. 67 16. 25 When is resource R idle? Apparently, R not immediately available after rdy B.

Resource usage modeling Job id 123 127 136 132 rdy A 8. 58 11.

Resource usage modeling Job id 123 127 136 132 rdy A 8. 58 11. 13 12. 09 13. 12 A 2 B start B 8. 79 11. 26 13. 24 14. 87 st B 1. 22 1. 84 1. 43 1. 38 rdy B 10. 01 13. 10 14. 67 16. 25 rdy B 0. 21 0. 13 ? ? 0. 14 0. 20 B-queue empty ↔ t can be timed ↔ u cannot be timed

DCT processing Important for keeper occupation: arrival (ar), start (sk), error (er), approved (ap),

DCT processing Important for keeper occupation: arrival (ar), start (sk), error (er), approved (ap), fail (fl). ar 30(BF) 31(B) 32(B). . . 44(BF) 42(B) 43(F) 45(B) 46(BF) sk er ap fl 31. 84 34. 70 - 37. 32 - 34. 85 37. 42 39. 49 - 44. 70 35. 42 39. 55 - 40. 79 - 47. 33 56. 06 - 56. 78 - 47. 68 56. 85 58. 26 63. 31 - 47. 89 58. 31 - 59. 11 - 50. 33 59. 16 - 61. 19 - 51. 84 63. 40 - 64. 33 - extra keeper occupation

Keeper process Keeper busy time(ap) - time(sk) + plm. 0. 07 time(er) - time(sk)

Keeper process Keeper busy time(ap) - time(sk) + plm. 0. 07 time(er) - time(sk) + ? (extra) Assumption: extra time equals normal check time if OK if failure if corrected

DCT processing Important for crane occupation: mv/d, s 1/2, gt/p, pt/p, rd. ap 19(B)

DCT processing Important for crane occupation: mv/d, s 1/2, gt/p, pt/p, rd. ap 19(B) 21(B) 24(B) 25(B) mv gt mv rd pp 23. 70 - 24. 19 24. 38 24. 84 25. 52 - 27. 29 27. 50 27. 93 28. 41 - 30. 77 30. 94 31. 30 29. 00 31. 53 32. 06 32. 29 32. 93 0. 21 20(BF) 0. 23 0. 19 ap mv gt pp md s 1 gp mv pt rd 24. 36 25. 05 25. 33 25. 94 26. 16 26. 31 26. 44 26. 68 27. 10 27. 28 ap mv md s 2 gp mv pt rd 22(F) 23(F) 26. 22 - 28. 12 - 28. 27 28. 47 28. 86 29. 10 26. 89 29. 11 - 29. 60 29. 80 29. 98 30. 53 30. 75

Crane process Six different paths: B, F, BF, with and without extra first move.

Crane process Six different paths: B, F, BF, with and without extra first move. F and BF have an optional s 1/s 2 step for obtaining the needed container. Two modeling options: 1. Model each step; fit distributions for each step. Do not forget the extra time after "pp" step. 2. Aggregate and use a bit of analysis to approximate distribution(s). Simulation can be used to find out whether option 2 is appropriate.