• DocumentCode
    2650259
  • Title

    A Polynomial Time Algorithm for Coordination of Pricing and Lot Sizing Model with Backlogging

  • Author

    Dao-ming, DAI ; Kui, LU ; Hua-wei, MA

  • Author_Institution
    Hefei Univ. of Technol., Hefei
  • fYear
    2007
  • fDate
    20-22 Aug. 2007
  • Firstpage
    375
  • Lastpage
    380
  • Abstract
    In decentralized policy, lot sizing models with backlogging (LSP-B) tend to neglect the effects of market on production. In this paper, pricing is introduced into general LSP-B and by coordinating pricing and LSP-B, the rational price can be set such that the firm´s profit is maximized. Demand is a deterministic function of price. It is primarily concerned that the same selling price on a product is maintained throughout horizon. An exact algorithm is developed to solve joint fixed pricing and LSP-B in polynomial time. The algorithm is based on alternate decisions on pricing and production. By restarting the alternate decisions repeatedly, the optimal pricing and corresponding production plan can be solved recursively. Results show that the joint policy may contribute more profit to the firm than the decentralized policy.
  • Keywords
    lot sizing; polynomial approximation; pricing; profitability; joint fixed pricing; lot sizing models with backlogging; polynomial time algorithm; profit; Conference management; Costs; Enterprise resource planning; Financial management; Flexible manufacturing systems; Lot sizing; Polynomials; Pricing; Production; Technology management; backlogging; coordination; lot sizing problem; pricing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Management Science and Engineering, 2007. ICMSE 2007. International Conference on
  • Conference_Location
    Harbin
  • Print_ISBN
    978-7-88358-080-5
  • Electronic_ISBN
    978-7-88358-080-5
  • Type

    conf

  • DOI
    10.1109/ICMSE.2007.4421876
  • Filename
    4421876