IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v42y1996i11p1556-1564.html
   My bibliography  Save this article

A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging

Author

Listed:
  • E. Powell Robinson, Jr.

    (Department of Business Analysis, College of Business Administration, Texas A&M University, College Station, Texas 77812)

  • Li-Lian Gao

    (Department of Management, School of Business, Hofstra University, Hempstead, New York 11550)

Abstract

This paper describes a mixed-integer programming formulation and dual ascent based branch-and-bound algorithm for the multiproduct dynamic demand coordinated replenishment problem with backlogging. The single sourcing properties of the formulation and the hierarchical structure of the fixed-charge and continuous variables yield an extremely tight linear programming relaxation for the problem. A branch-and-bound algorithm based on Erlenkotter's dual ascent, dual adjustment, and primal construction concepts exploits these properties to obtain an efficient solution procedure. Computational results indicate that the new procedures find optimal solutions in less than five percent of the computational time of the most efficient previous algorithm. The heuristic performance of the procedures also demonstrate their superiority over existing approaches. We solved problems with 12 time periods and 20 products in 0.41 CPU seconds, and heuristic solutions with a worst-case three-percent optimality gap are found in 0.068 CPU seconds. The efficiency and large-scale capability of the procedures make their potential application in inventory requirements planning systems promising.

Suggested Citation

  • E. Powell Robinson, Jr. & Li-Lian Gao, 1996. "A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging," Management Science, INFORMS, vol. 42(11), pages 1556-1564, November.
    • Handle: RePEc:inm:ormnsc:v:42:y:1996:i:11:p:1556-1564
    DOI: 10.1287/mnsc.42.11.1556
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.42.11.1556
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.42.11.1556?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dong Liang & Wilbert E. Wilhelm, 2013. "Dual‐ascent and primal heuristics for production‐assembly‐distribution system design," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 1-18, February.
    2. Chia‐Shin Chung & Sin‐Hoon Hum & Omer Kirca, 2000. "An optimal procedure for the coordinated replenishment dynamic lot‐sizing problem with quantity discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 686-695, December.
    3. Narayanan, Arunachalam & Robinson, Powell, 2010. "Evaluation of joint replenishment lot-sizing procedures in rolling horizon planning systems," International Journal of Production Economics, Elsevier, vol. 127(1), pages 85-94, September.
    4. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    5. E P Robinson & A Narayanan & L-L Gao, 2007. "Effective heuristics for the dynamic demand joint replenishment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 808-815, June.
    6. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    7. Narayanan, Arunachalam & Robinson, Powell, 2010. "Efficient and effective heuristics for the coordinated capacitated lot-size problem," European Journal of Operational Research, Elsevier, vol. 203(3), pages 583-592, June.
    8. Oğuz Solyalı & Haldun Süral, 2012. "The one-warehouse multi-retailer problem: reformulation, classification, and computational results," Annals of Operations Research, Springer, vol. 196(1), pages 517-541, July.
    9. Ertogral, Kadir, 2008. "Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach," European Journal of Operational Research, Elsevier, vol. 191(1), pages 156-165, November.
    10. Kremer, Mirko & Schneeweiss, Christoph & Zimmermann, Michael, 2006. "On the validity of aggregate models in designing supply chain contracts," International Journal of Production Economics, Elsevier, vol. 103(2), pages 656-666, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:42:y:1996:i:11:p:1556-1564. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.