IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v57y2014i2p441-468.html
   My bibliography  Save this article

Optimizing a multi-stage production/inventory system by DC programming based approaches

Author

Listed:
  • Hoai Le Thi
  • Duc Tran

Abstract

This paper deals with optimizing the cost of set up, transportation and inventory of a multi-stage production system in presence of bottleneck. The considered optimization model is a mixed integer nonlinear program. We propose two methods based on DC (Difference of Convex) programming and DCA (DC Algorithm)—an innovative approach in nonconvex programming framework. The mixed integer nonlinear problem is first reformulated as a DC program and then DCA is developed to solve the resulting problem. In order to globally solve the problem, we combine DCA with a Branch and Bound algorithm (BB-DCA). A convex minorant of the objective function is introduced. DCA is used to compute upper bounds while lower bounds are calculated from a convex relaxation problem. The numerical results compared with those of COUENNE ( http://www.coin-or.org/download/binary/Couenne/ ), a solver for mixed integer nonconvex programming, show the rapidity and the ϵ-globality of DCA in almost cases, as well as the efficiency of the combined DCA-Branch and Bound algorithm. We also propose a simple heuristic algorithm which is proved by experimental results to be better than an existing heuristic in the literature for this problem. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Hoai Le Thi & Duc Tran, 2014. "Optimizing a multi-stage production/inventory system by DC programming based approaches," Computational Optimization and Applications, Springer, vol. 57(2), pages 441-468, March.
    • Handle: RePEc:spr:coopap:v:57:y:2014:i:2:p:441-468
    DOI: 10.1007/s10589-013-9600-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-013-9600-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-013-9600-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. C. Jeroslow, 1973. "There Cannot be any Algorithm for Integer Programming with Quadratic Constraints," Operations Research, INFORMS, vol. 21(1), pages 221-224, February.
    2. Bogaschewsky, Ronald W. & Buscher, Udo D. & Lindner, Gerd, 2001. "Optimizing multi-stage production with constant lot size and varying number of unequal sized batches," Omega, Elsevier, vol. 29(2), pages 183-191, April.
    3. Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
    4. Hsiao, Yu-Cheng & Lin, Yi & Huang, Yun-Kuei, 2010. "Optimal multi-stage logistic and inventory policies with production bottleneck in a serial supply chain," International Journal of Production Economics, Elsevier, vol. 124(2), pages 408-413, April.
    5. Hsiao, Yu-Cheng, 2008. "Optimal single-cycle policies for the one-warehouse multi-retailer inventory/distribution system," International Journal of Production Economics, Elsevier, vol. 114(1), pages 219-229, July.
    6. Goyal, S. K. & Szendrovits, A. Z., 1986. "A constant lot size model with equal and unequal sized batch shipments between production stages," Engineering Costs and Production Economics, Elsevier, vol. 10(3), pages 203-210, March.
    7. Szendrovits, Andrew Z & Drezner, ZVI, 1980. "Optimizing multi-stage production with constant lot size and varying numbers of batches," Omega, Elsevier, vol. 8(6), pages 623-629.
    8. Andrew Z. Szendrovits, 1975. "Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model," Management Science, INFORMS, vol. 22(3), pages 298-308, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ali Khaleel Dhaiban, 2022. "Two models of inventory system with stochastic demand and deteriorating items: case study of a local cheese factory," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 78-101, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hsiao, Yu-Cheng & Lin, Yi & Huang, Yun-Kuei, 2010. "Optimal multi-stage logistic and inventory policies with production bottleneck in a serial supply chain," International Journal of Production Economics, Elsevier, vol. 124(2), pages 408-413, April.
    2. Wen-Tsung Ho & Jason Chao-Hsien Pan & Yu-Cheng Hsiao, 2012. "Optimizing Multi-stage Production for an Assembly-Type Supply Chain with Unequal Sized Batch Shipments," Journal of Optimization Theory and Applications, Springer, vol. 153(2), pages 513-531, May.
    3. Wen-Tsung Ho & Yu-Cheng Hsiao, 2014. "Optimal Mixed Batch Shipment Policy with Variable Safety Factor for the Single-Vendor Single-Buyer Production-Inventory System," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 648-663, May.
    4. Wen-Tsung Ho & Shu-Fang Lai & Yun-Kuei Huang, 2014. "An Optimal Mixed Batch Shipment Policy for Multiple Items in a Single-Supplier Multiple-Retailer Integrated System," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 636-658, February.
    5. Bogaschewsky, Ronald W. & Buscher, Udo D. & Lindner, Gerd, 2001. "Optimizing multi-stage production with constant lot size and varying number of unequal sized batches," Omega, Elsevier, vol. 29(2), pages 183-191, April.
    6. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    7. Sarin, Subhash C. & Kalir, Adar A. & Chen, Ming, 2008. "A single-lot, unified cost-based flow shop lot-streaming problem," International Journal of Production Economics, Elsevier, vol. 113(1), pages 413-424, May.
    8. Hoque, M.A. & Kingsman, B.G., 2006. "Synchronization in common cycle lot size scheduling for a multi-product serial supply chain," International Journal of Production Economics, Elsevier, vol. 103(1), pages 316-331, September.
    9. Hsiao, Yu-Cheng, 2008. "Integrated logistic and inventory model for a two-stage supply chain controlled by the reorder and shipping points with sharing information," International Journal of Production Economics, Elsevier, vol. 115(1), pages 229-235, September.
    10. Hoque, M.A., 2011. "An optimal solution technique to the single-vendor multi-buyer integrated inventory supply chain by incorporating some realistic factors," European Journal of Operational Research, Elsevier, vol. 215(1), pages 80-88, November.
    11. Kim, DaeSoo, 1999. "Optimal two-stage lot sizing and inventory batching policies," International Journal of Production Economics, Elsevier, vol. 58(3), pages 221-234, January.
    12. Jaber, Mohamad Y. & Khan, Mehmood, 2010. "Managing yield by lot splitting in a serial production line with learning, rework and scrap," International Journal of Production Economics, Elsevier, vol. 124(1), pages 32-39, March.
    13. Hoque, M. A. & Kingsman, B. G., 1995. "An optimal solution algorithm for the constant lot-size model with equal and unequal sized batch shipments for the single product multi-stage production system," International Journal of Production Economics, Elsevier, vol. 42(2), pages 161-174, December.
    14. Kimms, Alf & Drexl, Andreas, 1996. "Multi-level lot sizing: A literature survey," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 405, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Hamidur Rahman & Ashutosh Mahajan, 2020. "On the facet defining inequalities of the mixed-integer bilinear covering set," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 545-575, December.
    16. Min Tao & Jiang-Ning Li, 2023. "Error Bound and Isocost Imply Linear Convergence of DCA-Based Algorithms to D-Stationarity," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 205-232, April.
    17. Hoai An Le Thi & Van Ngai Huynh & Tao Pham Dinh, 2018. "Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 103-126, October.
    18. João Carlos O. Souza & Paulo Roberto Oliveira & Antoine Soubeyran, 2016. "Global convergence of a proximal linearized algorithm for difference of convex functions," Post-Print hal-01440298, HAL.
    19. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    20. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.

    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:spr:coopap:v:57:y:2014:i:2:p:441-468. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.