English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88654/118227 (75%)
Visitors : 23501660      Online Users : 759
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/81312
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/81312


    Title: Solving two-dimensional Markov chain model for call centers
    Authors: 陸行
    Liang, Chih-Chin
    Contributors: 應數系
    Keywords: Call center;Management cost;Operators management;Two-dimensional Markov chain
    Date: 2015
    Issue Date: 2016-02-18 13:37:43 (UTC+8)
    Abstract: Purpose – The purpose of this paper is to develop a novel model of a call center that must treat calls with distinctly different service depending on whether they orginate from VIP or regular customers. VIP calls must be responded to immediately but regular calls can be routed to a retrial queue if the operators are busy. Design/methodology/approach – This study’s proposed model can easily reveal the optimal arrangement of operators while minimizing computational time and without losing any precision of the performance measure when dealing with a call center with more operators. Findings – Based on the results of the comparison between the exact method and the proposed approximation method, the approach shows that the larger the number of operators or inbound calls, the smaller the error between the two methods. Originality/value – This investigation presents a computational method and management cost function intended to identify the optimal number of operators for a call center. Because of computational limitations, many operators could not be easily analyzed using the exact method. For the manager of a call center, the sooner the optimal solution is found, the faster business strategies are deployed. This study develops an approximation method and compares it with the exact method.
    Relation: Industrial Management & Data Systems, 115(5), 901-922
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1108/IMDS-12-2014-0363
    DOI: 10.1108/IMDS-12-2014-0363
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    901-922.pdf705KbAdobe PDF299View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback