Academic literature on the topic 'M/G/1'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'M/G/1.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "M/G/1"
Aalto, Samuli, Urtzi Ayesta, and Eeva Nyberg-Oksanen. "M/G/1/MLPS compared to M/G/1/PS." Operations Research Letters 33, no. 5 (September 2005): 519–24. http://dx.doi.org/10.1016/j.orl.2004.09.009.
Full textJ., Joseline Manora, and Vignesh S. "Results on $\gamma_{M}^{-1}(G)$ and $\gamma_{M}^{-1}(\bar{G})$." Malaya Journal of Matematik S, no. 1 (2020): 358–62. http://dx.doi.org/10.26637/mjm0s20/0067.
Full textNakatsuka, Toshinao. "QUEUE LENGTH DISTRIBUTION IN M/G/1, M^x/G/1 AND THEIR VARIANTS WITH COMPLETION TIME." Journal of the Operations Research Society of Japan 52, no. 1 (2009): 11–34. http://dx.doi.org/10.15807/jorsj.52.11.
Full textAli, Hydar. "Expected number of departures in M/M/1 and G/G/1 queues." Advances in Applied Probability 22, no. 3 (September 1990): 770–72. http://dx.doi.org/10.2307/1427474.
Full textGail, H. R., S. L. Hantler, and B. A. Taylor. "Spectral analysis of M/G/1 and G/M/1 type Markov chains." Advances in Applied Probability 28, no. 1 (March 1996): 114–65. http://dx.doi.org/10.2307/1427915.
Full textGail, H. R., S. L. Hantler, and B. A. Taylor. "Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains." Advances in Applied Probability 29, no. 3 (September 1997): 733–58. http://dx.doi.org/10.2307/1428084.
Full textAli, Hydar. "Expected number of departures in M/M/1 and G/G/1 queues." Advances in Applied Probability 22, no. 03 (September 1990): 770–72. http://dx.doi.org/10.1017/s0001867800020048.
Full textGail, H. R., S. L. Hantler, and B. A. Taylor. "Spectral analysis of M/G/1 and G/M/1 type Markov chains." Advances in Applied Probability 28, no. 01 (March 1996): 114–65. http://dx.doi.org/10.1017/s0001867800027300.
Full textGail, H. R., S. L. Hantler, and B. A. Taylor. "Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains." Advances in Applied Probability 29, no. 03 (September 1997): 733–58. http://dx.doi.org/10.1017/s0001867800028329.
Full textKim, Bara, and Jeongsim Kim. "Analysis of the $$M^X/G/1$$ M X / G / 1 retrial queue." Annals of Operations Research 247, no. 1 (June 13, 2015): 193–210. http://dx.doi.org/10.1007/s10479-015-1921-6.
Full textDissertations / Theses on the topic "M/G/1"
Prado, Silvia Maria. "Modelos alternativos em filas M/G/1." Universidade Federal de São Carlos, 2015. https://repositorio.ufscar.br/handle/ufscar/8693.
Full textApproved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-05-02T13:03:01Z (GMT) No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)
Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-05-02T13:03:17Z (GMT) No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)
Made available in DSpace on 2017-05-02T13:06:24Z (GMT). No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5) Previous issue date: 2015-11-26
Não recebi financiamento
The main aim of this work is to develop alternative queuing models to M/ G/l, in which arrivals follow a Poisson process, the total number of customers on the system and the total number of service channels are unknown. Our interest is just to observe the service channel that will offer the maximum or minimum service time. Wherefore, the service distributions are obtained from the composition of the Conwav-Maxwell-Poisson distribution truncated at zero, used to model the number of service channels, with the general distribution to the maximum and minimum service time. Thus, we obtain new distributions for service time, which are called Maximum-Conwav-Maxwell-Poisson-general, denoted by MAXCOMPG distribution, and Minimum-Conwav-Maxwell-Poisson-general, denoted by MINCOMPG distribution, consequently, we obtain the queue models M/MAXCOMPG/1 and M/MINCOMPG/ 1, respectively. As general distributions, we use the distributions exponential, Weibull and Birnbaum Saunders, To illustrate the proposed queue models, a simulation study is done and also real data are used.
Este trabalho tem como objetivo apresentar modelos de filas alternativos ao M/G/l, nos quais as chegadas seguem um processo de Poisson, o número total de usuários no sistema e o número total de canais de atendimento são desconhecidos. Neste caso, observamos apenas o canal de serviço que irá oferecer o máximo ou o mínimo tempo de serviço. Para isto, as distribuições de serviço são obtidas a partir da composição da distribuição Conwav-Maxwell-Poisson truncada no ponto zero, usada para modelar o número de canais de atendimento, com uma distribuição geral para o máximo e o mínimo tempos de serviço. Desta forma, surgem novas distribuições de serviço que são denominadas de Máximo-Conwav-Maxwell-Poisson-geral, denotada por distribuição MAXCOMPG, e Mínimo-Conwav-Maxwell-Poisson-geral, denotada por distribuição MINCOMPG, e, assim, obtemos os modelos de fila M MAXCOMPG 1 e M MINCOMPG 1. Como distribuições gerais usamos as distribuições exponencial, Weibull e Birnbaum Saunders, Para ilustrar os modelos de fila propostos um amplo estudo de simulação é feito e dados reais também são utilizados.
Böhm, Walter. "A transient Analysis of M/G/1 Queues with N-policy." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 1991. http://epub.wu.ac.at/738/1/document.pdf.
Full textSeries: Forschungsberichte / Institut für Statistik
Hou, Yunkui. "Stochastic optimal control of G/M/1 queueing system with breakdowns /." The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487694702782079.
Full textSlamet, Isnandar. "Transient analysis of M/G/1 queueing models: lattice path approach." Thesis, Curtin University, 2013. http://hdl.handle.net/20.500.11937/168.
Full textMak, Chi Kin School of Mathematics UNSW. "On complex reflection groups G(m, 1, r) and their Hecke algebras." Awarded by:University of New South Wales. School of Mathematics, 2003. http://handle.unsw.edu.au/1959.4/20777.
Full textKeilson, Julian, and Les D. Servi. "Extended Vacation Systems and the Universality of the M/G/1/K Blocking Formula." Massachusetts Institute of Technology, Operations Research Center, 1989. http://hdl.handle.net/1721.1/5382.
Full textWhiting, P. A. "A class of G/M/1 priority queues and its application to performance analysis." Thesis, University of Strathclyde, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382422.
Full textRýzner, Zdeněk. "Využití teorie hromadné obsluhy při návrhu a optimalizaci paketových sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219285.
Full textFatnes, Johan Narvestad. "Flow-times in an M/G/1 Queue under a Combined Preemptive/Non-preemptive Priority Discipline. : Scheduled Waiting Time on Single Track Railway Lines." Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10031.
Full textA priority based rule for use during the process of scheduling trains oper- ating on a single track railway line was proposed by the Norwegian railway operator and owner, Jernbaneverket. The purpose of this study is to inves- tigate the effect of the suggested scheduling rule on the scheduled waiting times suffered by trains operating on a segment of the railway line. It is shown that the scheduling rule, under certain limiting assumptions, can be studied in the setting of queuing theory and that it has properties in common with a theoretical priority discipline combining two well docu- mented priority rules. The main part of this study is the development and analysis of a threshold based, combined preemptive/non-preemptive priority discipline. Under the combined discipline, preemptions are allowed during the early stage of processing only. Theoretical expressions for flow-times of jobs passing through the queuing system are reached through detailed studies of the non-preemptive and the preemptive priority discipline. The relationship between the suggested priority based scheduling rule and the theoretical, combined priority discipline is finally illustrated by sim- ulations. When adjusted for actual time spent by trains on traversing the line segment, the steady state solution for flow-times obtained from queuing theory yields an accurate expression for the trains average scheduled wait- ing times. The scheduling problem can in fact be modeled accurately by an M/G/1 queue under the combined priority discipline.
Maraghi, Farzana Abdulla. "A study of some M[x]/G/1 type queues with random breakdowns and Bernouilli schedule server vacations based on a single vacation policy." Thesis, Brunel University, 2008. http://bura.brunel.ac.uk/handle/2438/5540.
Full textBooks on the topic "M/G/1"
Keilson, Julian. A two priority M/G/1 queue with feedback. Cambridge, Mass: Sloan School of Management, Massachusetts Institute of Technology, 1988.
Find full textGaver, Donald Paul. On inference and transient response for M/G/1 models. Monterey, Calif: Naval Postgraduate School, 1986.
Find full textCooke, Norman. New models in the study of M/G/1 retrail queues. [s.l: The Author], 1995.
Find full textJacobs, Patricia A. Inferring finite-time performance in the M/G/1 queueing model. Monterey, Calif: Naval Postgraduate School, 1989.
Find full textStructured stochastic matrices of M/G/1 type and their applications. New York: Marcel Dekker, 1989.
Find full textWein, Lawrence M. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Cambridge, Mass: Sloan School of Management, Massachusetts Institute of Technology, 1988.
Find full textGaver, Donald P. Nonparametric estimation of the probability of a long delay in the M/G/1 queue. Monterey, California: Naval Postgraduate School, 1986.
Find full text(Federation), Russia. Tamozhennoe pravo Rossii: Sbornik normativnykh aktov (s 2-m dopolneniem) : po sostoi͡a︡nii͡u︡ na 1 apreli͡a︡ 1996 g. Moskva: Izd-vo BEK, 1996.
Find full textAshkhat︠s︡ava, S. M. Puti razvitii︠a︡ abkhazskoĭ istorii: Doklad, chitannyĭ na 1-m Vsesoi︠u︡znom Kraevedcheskom sʺezde v Abkhazii 12 senti︠a︡bri︠a︡ 1924 g. Sukhum: [s.l.], 2006.
Find full textSotheby, Parke-Bernet, London. European ceramics, Dutch delftware and glass: Including the property of Mr. G. M. , Belgium : [day ofsale] Tuesday, October 1, 1996 .... Amsterdam: Sotheby's, 1996.
Find full textBook chapters on the topic "M/G/1"
Brill, Percy H. "G/M/1 and G/M/c Queues." In Level Crossing Methods in Stochastic Models, 285–335. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-50332-5_5.
Full textLipsky, Lester. "M/G/1 Queue." In Queueing Theory, 185–286. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-49706-8_4.
Full textLipsky, Lester. "G/M/1 Queue." In Queueing Theory, 287–355. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-49706-8_5.
Full textNelson, Randolph. "The M/G/1 Queue." In Probability, Stochastic Processes, and Queueing Theory, 283–327. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4757-2426-4_7.
Full textDaigle, John N. "Vector Markov Chain Analysis: The M/G/1 and G/M/1 Paradigms." In Queueing Theory with Applications to Packet Telecommunication, 253–96. Boston, MA: Springer US, 2005. http://dx.doi.org/10.1007/0-387-22859-4_7.
Full textHaviv, Moshe. "The G/M/1 Queueing System." In Queues, 99–105. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6_7.
Full textBrill, Percy H. "M/G/1 Queues And Variants." In Level Crossing Methods in Stochastic Models, 1–114. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-09421-2_3.
Full textBrill, Percy H. "M/G/1 Queues and Variants." In Level Crossing Methods in Stochastic Models, 49–185. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-50332-5_3.
Full textHaviv, Moshe. "Priorities and Scheduling in M/G/1." In Queues, 71–80. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6_5.
Full textPrabhu, N. U. "The System M/G/1; Priority Systems." In International Series in Operations Research & Management Science, 123–48. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6205-4_7.
Full textConference papers on the topic "M/G/1"
Najm, Elie, Roy Yates, and Emina Soljanin. "Status updates through M/G/1/1 queues with HARQ." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006504.
Full textSun, Hai-Zhen, Bao-You Liu, and Hua Li. "Application of M/G/1/N in solid garage." In 2010 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE, 2010. http://dx.doi.org/10.1109/icmlc.2010.5580629.
Full textJing Peng, Oualid Jouini, Yves Dallery, and Zied Jemai. "Service capacity pooling in M/G/1 service systems." In 2015 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2015. http://dx.doi.org/10.1109/iesm.2015.7380292.
Full textScully, Ziv, Mor Harchol-Balter, and Alan Scheller-Wolf. "Simple Near-Optimal Scheduling for the M/G/1." In SIGMETRICS '20: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3393691.3394216.
Full textDieleman, Nanne, Bernd Heidergott, and Yijie Peng. "Data-Driven Fitting of the M/G/1 Queue." In 2019 16th International Conference on Service Systems and Service Management (ICSSSM). IEEE, 2019. http://dx.doi.org/10.1109/icsssm.2019.8887609.
Full textTasneem, Sarah, Feng Zhang, Lester Lipsky, and Steve Thompson. "Comparing different scheduling schemes for M/G/1 queue." In Computer Engineering (ICECE). IEEE, 2010. http://dx.doi.org/10.1109/icelce.2010.5700800.
Full textScully, Ziv, and Mor Harchol-Balter. "The Gittins Policy in the M/G/1 Queue." In 2021 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt). IEEE, 2021. http://dx.doi.org/10.23919/wiopt52861.2021.9589051.
Full textNajm, Elie, and Emre Telatar. "Status updates in a multi-stream M/G/1/1 preemptive queue." In 2018 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2018. http://dx.doi.org/10.1109/infcomw.2018.8406928.
Full textPacheco, António, and Helena Ribeiro. "Consecutive customer loss probabilities in M/G/1/n and GI/M(m)//n systems." In Proceeding from the 2006 workshop. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1190366.1190374.
Full textLian, Zhaotong, and Ning Zhao. "A two-stage M/G/1 queue with discretionary priority." In 2011 IEEE MTT-S International Microwave Workshop Series on Innovative Wireless Power Transmission: Technologies, Systems, and Applications (IMWS 2011). IEEE, 2011. http://dx.doi.org/10.1109/imws.2011.6115402.
Full textReports on the topic "M/G/1"
Serfozo, Richard F. Extreme Values of Queue Lengths in M/G/1 and GI/M/1 Systems. Fort Belvoir, VA: Defense Technical Information Center, November 1986. http://dx.doi.org/10.21236/ada177117.
Full textKrakowski, Martin. M/G/1 with Exceptional Service and Arrival Rate. Fort Belvoir, VA: Defense Technical Information Center, October 1988. http://dx.doi.org/10.21236/ada201369.
Full textKrakowski, Martin. System Size and Remaining Service in M/G/1. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada211718.
Full textKim, Sung S., and Richard F. Serfozo. Optimal Idle and Inspection Periods for M/G/1 Queues,. Fort Belvoir, VA: Defense Technical Information Center, March 1986. http://dx.doi.org/10.21236/ada170110.
Full textBrill, Percy H., and Carl M. Harris. Waiting Times for M/G/1 Queues with Service-Time-Dependent Server Vacations. Fort Belvoir, VA: Defense Technical Information Center, June 1989. http://dx.doi.org/10.21236/ada209597.
Full textHART (FRED C) ASSOCIATES INC NEW YORK. Installation Restoration Program. Phase 2. Confirmation/Quantification. Stage 1 for Minot Air Force Base, Minot, North Dakota. Volume 3. Appendices G through M. Fort Belvoir, VA: Defense Technical Information Center, October 1988. http://dx.doi.org/10.21236/ada205411.
Full textGrumet, Rebecca, Rafael Perl-Treves, and Jack Staub. Ethylene Mediated Regulation of Cucumis Reproduction - from Sex Expression to Fruit Set. United States Department of Agriculture, February 2010. http://dx.doi.org/10.32747/2010.7696533.bard.
Full textWillis, C., F. Jorgensen, S. A. Cawthraw, H. Aird, S. Lai, M. Chattaway, I. Lock, E. Quill, and G. Raykova. A survey of Salmonella, Escherichia coli (E. coli) and antimicrobial resistance in frozen, part-cooked, breaded or battered poultry products on retail sale in the United Kingdom. Food Standards Agency, May 2022. http://dx.doi.org/10.46756/sci.fsa.xvu389.
Full textMacFarlane, Andrew. 2021 medical student essay prize winner - A case of grief. Society for Academic Primary Care, July 2021. http://dx.doi.org/10.37361/medstudessay.2021.1.1.
Full text