Skip to main content
SpringerLink
Log in

Cross-Facility Production and Transportation Planning Problem with Perishable Inventory

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

Abstract

This study addresses a production and distribution planning problem in a dynamic, two-stage supply chain. This supply chain consists of a number of facilities and retailers. The model considers that the final product is perishable and therefore has a limited shelf life. We formulate this problem as a network flow problem with a fixed charge cost function which is NP-hard. A primal-dual heuristic is developed that provides lower and upper bounds. The models proposed can be used for operational decisions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Johnson, D.S., Lenstra, J.K., Rinnooy Kan, A.H.G.: The complexity of the network design problem. Networks 8, 279–285 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  2. Nahmias, S.: Perishable inventory theory: A review. Operations Research 30, 680–708 (1982)

    Article  MATH  Google Scholar 

  3. Hsu, V.N.: Dynamic economic lot size model with perishable inventory. Management Science 46, 1159–1169 (2000)

    Article  Google Scholar 

  4. Myers, D.C.: Meeting seasonal demand for products with limited shelf lives. Naval Research Logistics 44, 473–483 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Management Science 5, 89–96 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zangwill, W.I.: Minimum concave cost flows in certain networks. Management Science 14, 429–450 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  7. Wagelmans, A., van Hoesel, S., Kolen, A.: Economic lot sizing: An O(n logn) algorithm that runs in linear time in the wagner-whitin case. Operations Research 40, 145–156 (1992)

    Article  MathSciNet  Google Scholar 

  8. Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Operations Research 26, 992–1009 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ekşioğlu, S.D., Romeijn, H.E., Pardalos, P.M.: Cross-facility management of production and transportation planning problem. Comp. Oper. Res. (in press)

    Google Scholar 

  10. Hochbaum, D.S., Segev, A.: Analysis of a flow problem with fixed charges. Networks 19, 291–312 (1989)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, Mississippi State, MS, 39762, USA

    Sandra Duni Ekşioğlu & Mingzhou Jin

Authors
  1. Sandra Duni Ekşioğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingzhou Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ekşioğlu, S.D., Jin, M. (2006). Cross-Facility Production and Transportation Planning Problem with Perishable Inventory. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_75

Download citation

  • DOI: https://doi.org/10.1007/11751595_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation