English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 110944/141864 (78%)
Visitors : 48053297      Online Users : 1214
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/99414
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/99414


    Title: 關於具有優先順序但無耐心等候之多服務員排隊模型
    On Two Priority Multi-Server Queues with Impatient Customers
    Authors: 李泓緯
    Contributors: 陸行
    李泓緯
    Keywords: 多服務員等候系統
    無耐心排隊
    非搶占優先服務策略
    Date: 2016
    Issue Date: 2016-07-21 10:01:45 (UTC+8)
    Abstract: 我們考慮多服務員的排隊系統,其中包含兩種沒耐心的顧客群,分別是
    高優先級和低優先級的顧客。顧客的到來滿足布阿松過程,顧客群有一個滿
    足指數分配的耐心程度,在超出這段時間後,會離開系統。在本文中,服
    務時間服從指數分配。所有的顧客和服務類型分為先來先服務(First Come First Served, FCFS)和後來先服務(Last Come First Served, LCFS)兩種。藉由隨機變數的拉普拉斯轉換和矩陣幾何方法配合截取法,得到一個近似值的機率分配。我們會計算兩顧客群等候時間的期望值。並且對於較重要的高優先級顧客,計算他們有給定條件的期望值。
    Reference: [1] F. Baccelli and G. Hebuterne. On queues with impatient customers. 1981.
    [2] A. Brandt and M. Brandt. On the m (n)/m (n)/s queue with impatient calls. Performance
    Evaluation, 35(1):1–18, 1999.
    [3] B. D. Choi, B. Kim, and J. Chung. M/m/1 queue with impatient customers of higher
    priority. Queueing Systems, 38(1):49–66, 2001.
    [4] O. Garnett, A. Mandelbaum, and M. Reiman. Designing a call center with impatient customers.
    Manufacturing & Service Operations Management, 4(3):208–227, 2002.
    [5] F. Iravani and B. Balcıog̃lu. On priority queues with impatient customers. Queueing
    Systems, 58(4):239–260, 2008.
    [6] D. L. Jagerman. Difference equations with applications to queues. CRC Press, 2000.
    [7] O. Jouini and A. Roubos. On multiple priority multi-server queues with impatience. Journal
    of the Operational Research Society, 65(5):616–632, 2013.
    [8] O. Jouini, Z. Aksin, and Y. Dallery. Call centers with delay information: Models and
    insights. Manufacturing & Service Operations Management, 13(4):534–548, 2011.
    [9] E. P. Kao and S. D. Wilson. Analysis of nonpreemptive priority queues with multiple
    servers and two priority classes. European Journal of Operational Research, 118(1):181–
    193, 1999.
    [10] O. Kella and U. Yechiali. Waiting times in the non-preemptive priority m/m/c queue.
    Stochastic Models, 1(2):257–262, 1985.
    [11] T. Phung-Duc and K. Kawanishi. Multiserver retrial queues with after-call work. Numerical
    Algebra, Control and Optimization, 1(4):639–656, 2011.
    [12] T. Phung-Duc, H. Masuyama, S. Kasahara, and Y. Takahashi. A simple algorithm for the
    rate matrices of level-dependent qbd processes. In Proceedings of the 5th international
    conference on queueing theory and network applications, pages 46–52. ACM, 2010.
    [13] T. Phung-Duc, H. Masuyama, S. Kasahara, and Y. Takahashi. A matrix continued fraction
    approach to multiserver retrial queues. Annals of Operations Research, 202(1):161–183,
    2013.
    [14] V. Sarhangian and B. Balciog̃lu. Waiting time analysis of multi-class queues with impatient
    customers. Probability in the Engineering and Informational Sciences, 27(03):333–352,
    2013.
    [15] A. Sleptchenko. Multi-class, multi-server queues with non-preemptive priorities. Eurandom,
    2003.
    [16] Q. Wang. Modeling and analysis of high risk patient queues. European Journal of Operational
    Research, 155(2):502–515, 2004.
    [17] S. Zeltyn, Z. Feldman, and S. Wasserkrug. Waiting and sojourn times in a multi-server
    queue with mixed priorities. Queueing Systems, 61(4):305–328, 2009.
    Description: 碩士
    國立政治大學
    應用數學系
    102751002
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0102751002
    Data Type: thesis
    Appears in Collections:[應用數學系] 學位論文

    Files in This Item:

    File SizeFormat
    100201.pdf379KbAdobe PDF2358View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback