English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 60868/93650 (65%)
造访人次 : 1149614      在线人数 : 12
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/59531


    题名: A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and trade credit financing
    作者: Dye, Chung-Yuan;Ouyang, Liang-Yuh
    贡献者: 淡江大學管理科學學系
    关键词: Inventory;Time-varying demand;Deteriorating items;Trade credit financing;Particle swarm optimization
    日期: 2011-02
    上传时间: 2011-10-04 15:41:19 (UTC+8)
    摘要: Pricing is a major strategy for a retailer to obtain its maximum profit. Furthermore, under most market behaviors, one can easily find that a vendor provides a credit period (for example 30 days) for buyers to stimulate the demand, boost market share or decrease inventories of certain items. Therefore, in this paper, we establish a deterministic economic order quantity model for a retailer to determine its optimal selling price, replenishment number and replenishment schedule with fluctuating demand under two levels of trade credit policy. A particle swarm optimization is coded and used to solve the mixed-integer nonlinear programming problem by employing the properties derived in this paper. Some numerical examples are used to illustrate the features of the proposed model.
    關聯: Computers & Industrial Engineering 60(1), pp.127–137
    DOI: 10.1016/j.cie.2010.10.010
    显示于类别:[管理科學學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and trade credit financing.pdf434KbAdobe PDF6检视/开启
    index.html0KbHTML15检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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