English  |  正體中文  |  简体中文  |  Items with full text/Total items : 50122/85142 (59%)
Visitors : 7895040      Online Users : 50
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/19717


    Title: The best opportunity and quantity of complete pre-ordered mechandise supply
    Other Titles: 完全預購性商品的最佳銷售時點與數量
    Authors: Chen, Miao-sheng;Wu, J. S.
    Contributors: 淡江大學經營決策學系
    Date: 1995-05-01
    Issue Date: 2009-11-30 12:19:35 (UTC+8)
    Publisher: Analytic Publishing Co
    New Delhi: Taru Publications
    Abstract: When a customer comes to a complete pre-ordered merchandise store and expresses his demand of a certain product, a supplier will inform him that he cannot obtain that product until a later time. At this moment, the customer will decide whether to buy that product or not while considering how long it will take him to wait.
    The product that suppliers of complete pre-ordered merchandise will face is: how to find out the best opportunity and quantity of supply after considering the connection between the time that takes customers to wait and their demand toward a pre-orderd merchandise. In this paper we intend to formulate a mathematical model to discuss the nature of the optimal solution.
    Relation: Journal of information & optimization sciences 16(2), pp.287-293
    DOI: 10.1080/02522667.1995.10699225
    Appears in Collections:[管理科學學系暨研究所] 期刊論文

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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