Queueing theory exercises part12

Pagina 1

LE209 QUEUEINGTHEORY EXERCISES Ex1RINASCIMENTOCLINIC solution Maps30pA R Ta f f y3020pANBOpth 17pA MIMA MM0.15.203pA 30pA SP 13pA MIMA gangMsp15pA aWa9 usa Ifo4.5min Wga2030 3020 4min Wasp IIa26min General steps for modelling a complex system: Shape the system and define the main 1. parameters Understand different kinds of customers and 2. their paths Compute the occurrences of the paths 3. Calculate throughput times 4. Decide strategic actions5. bPATH1RGpout WsEWsiE1 NsaWsop67612min Midi PATH2RGPSPout UsaNsaWsopWasp64673042min PATH3R SP out NsaUsaWsop673036min CWeegeeOccurrenceWsiII12 tg42 tg3623min dInactivitytime1fa606min471 g6015min Intimeap 1 2g6020min Intimes1 1g608min ES Mcat Mcat 1 FsdistheESa ygaggcorrespondent19 ofWsapplie 4f19a incaseofEls temptEsa ggaggpriority ForRandGPtherearenotvariationwhilsttherearevariations forsp thisleadsvariationsforpatientofpath2and3 Es II8.33min 19 ESa 1ELIA1 4f1gg 36.5min WsWs12min WSIWsWsopESa20.33min Wsggere23min WsjUsateSa 42.5min When a server is able to serve two classes of customers that have different service admission, under the hypothesis that customers of class 1 have a service admission priority higher than customers of class 2, we have to take into account two cases: - PREEMPTIVE PRIORITY - NON PREEMPTIVE PRIORITY Ex2Sterilisationcentre solution 70.3.154.5kITL 30 usukitthMIMB yysygg.skh Isi yea 71SK.it hM30kith 20 genMIMI 70.1503.1502.153.6 skitlhfifjthaxmlmdu3k.tk MIMA 30 cane ÈPREEMPTIVE A0.3.154Skita nonurgent S vestita1Okitth20 Opht aor.esitineYnItIYIIsIIGOYNORMAL Howmanypaths6urgent 6nonurgent 12 1CoORp 8CnoORGEp iii 3CoGEP 9CnoGEP g quagga 4CoGP 10CNGP 6Cutopnormal7 12noOPnormaP OCCURENCESocc 030.855158.5 occa0 085.10151 Occa015.0315151.5 Occa015.031534 Occa02.4156.674 0cg02191513.33 occa03.51510…