English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90068/105181 (86%)
Visitors : 7146439      Online Users : 391
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
    ASIA unversity > 管理學院 > 經營管理學系  > 期刊論文 >  Item 310904400/18337


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/18337


    Title: A HEURISTIC ALGORITHM FOR THE OPTIMIZATION OF M/M/s QUEUE WITH MULTIPLE WORKING VACATIONS
    Authors: 王國雄;Wang, Kuo-Hsiunh
    Contributors: 經營管理學系
    Keywords: Newton-Quasi algorithm;optimization;rate matrix;sensitivity anal- ysis;working vacations.
    Date: 2012-02
    Issue Date: 2012-11-26 12:47:24 (UTC+8)
    Abstract: This paper focuses on an M/M/s queue with multiple working vacations such that the server works with different service rates rather than no service during the vacation period. We show that this is a generalization of an M/M/1 queue with working vacations in the literature. Service times during vacation period, or during service period and vacation times are all exponentially distributed. We obtain the useful formula for the rate matrix R through matrix-geometric method. A cost function is formulated to determine the optimal number of servers subject to the stability conditions. We apply the direct search algorithm and Newton-Quasi algorithm to heuristically find an approximate solution to the constrained optimization problem. Numerical results are provided to illustrate the effectiveness of the computational algorithm.
    Relation: Journal of Industrial and Management Optimization
    Appears in Collections:[經營管理學系 ] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML242View/Open
    JIMO-0529_(final_version)_1 (1).pdf544KbAdobe PDF635View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback