IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v6y2009i4p447-457.html
   My bibliography  Save this article

Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems

Author

Listed:
  • Hiroshi Konno
  • Takaaki Egawa
  • Rei Yamamoto

Abstract

No abstract is available for this item.

Suggested Citation

  • Hiroshi Konno & Takaaki Egawa & Rei Yamamoto, 2009. "Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems," Computational Management Science, Springer, vol. 6(4), pages 447-457, October.
    • Handle: RePEc:spr:comgts:v:6:y:2009:i:4:p:447-457
    DOI: 10.1007/s10287-007-0052-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-007-0052-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10287-007-0052-1?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. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    2. Gabriel R. Bitran & Thomas L. Magnanti & Horacio H. Yanasse, 1984. "Approximation Methods for the Uncapacitated Dynamic Lot Size Problem," Management Science, INFORMS, vol. 30(9), pages 1121-1140, September.
    Full references (including those not matched with items on IDEAS)

    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. Shiono, Naoshi & Suzuki, Hisatoshi & Saruwatari, Yasufumi, 2019. "A dynamic programming approach for the pipe network layout problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 52-61.
    2. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    3. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    4. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    5. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    6. Xiao, Yiyong & Kaku, Ikou & Zhao, Qiuhong & Zhang, Renqian, 2011. "A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 214(2), pages 223-231, October.
    7. Julie A. Ward, 1999. "Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 106-129, February.
    8. Rita Vachani, 1992. "Performance of heuristics for the uncapacitated lot‐size problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(6), pages 801-813, October.
    9. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    10. Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, April.
    11. Chung-Yee Lee & Sila Çetinkaya & Wikrom Jaruphongsa, 2003. "A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse," Operations Research, INFORMS, vol. 51(5), pages 735-747, October.
    12. Awi Federgruen & Michal Tzur, 1993. "The dynamic lot‐sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 459-478, June.
    13. Trudeau, Christian, 2009. "Network flow problems and permutationally concave games," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 121-131, July.
    14. Chung‐Lun Li & Jinwen Ou & Vernon N. Hsu, 2012. "Dynamic lot sizing with all‐units discount and resales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 230-243, April.
    15. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    16. Sun, Zhuo & Zheng, Jianfeng, 2016. "Finding potential hub locations for liner shipping," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 750-761.
    17. Fontes, Dalila B.M.M. & Hadjiconstantinou, Eleni & Christofides, Nicos, 2006. "A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1205-1219, October.
    18. Hwang, Hark-Chin & Kang, Jangha, 2020. "The two-level lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 90(C).
    19. Chung-Yee Lee & Sila Çetinkaya & Albert P.M. Wagelmans, 1999. "A Dynamic Lot-Sizing Model with Demand Time Windows," Tinbergen Institute Discussion Papers 99-095/4, Tinbergen Institute.
    20. Steven J. Erlebacher & Medini R. Singh, 1999. "Optimal Variance Structures and Performance Improvement of Synchronous Assembly Lines," Operations Research, INFORMS, vol. 47(4), pages 601-618, August.

    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:comgts:v:6:y:2009:i:4:p:447-457. 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.