English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109951/140892 (78%)
Visitors : 46201546      Online Users : 531
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/96070


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/96070


    Title: 多重類型顧客在串聯佇列中的排程問題
    On The Assignment of Multi-class Customers to a Series of Queues
    Authors: 洪慶良
    Contributors: 陸行
    洪慶良
    Date: 1998
    Issue Date: 2016-05-10 16:24:28 (UTC+8)
    Abstract: 　　我們針對一個開放式的網路系統做最佳化的處理，而此網路是由一串聯佇列所組成，其中第一個佇列有兩種類型（類型0與類型1）的顧客進入，其餘的每個佇列都會有一種與其他佇列不同類型的顧客光臨，它們依照佇列順序分為類型2、3、4、…、m。每個佇列中只有一個服務員，並且服務的時間都是固定且相同的。在這篇論文中，我們的目的是對上述的網路求最小的期望存貨成本，但由於網路中的總人數與成本是成正比例的，所以在處理上，我們改以求最小的期望人數。在方法上，則藉由線性規劃的方式。並且我們發現到假如第二個佇列中的顧客人數大於所觀察的期數減一時，即(n-1)，則最好的策略處理原則是選取類型0的顧客到第一個佇列中做服務，以達到我們期望成木最小的目的。
    　　We deal with the optimal scheduling in an open queueing network a serip of queues in tandem with multi-class customers. Each queue is associated with only one server where all service times are constant and equal. The objective of this paper is to minimize the expected total discounted holding cost over a finite horizon n. Since the holding cost is proportional to the total numbe of customers in the network, we consider minimizing the expected number of customers over n horizons. By Linear Programming arguments we show that an optimal policy gives priority to class-0 customers at node 1 if the number of customers in queue 2 is larger than n-1.
    Description: 碩士
    國立政治大學
    應用數學系
    85751001
    Source URI: http://thesis.lib.nccu.edu.tw/record/#A2010000607
    Data Type: thesis
    Appears in Collections:[應用數學系] 學位論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML2261View/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