×

zbMATH — the first resource for mathematics

Transshipment through crossdocks with inventory and time windows. (English) Zbl 1278.90046
Summary: A major challenge in making supply meet demand is to coordinate transshipments across the supply chain to reduce costs and increase service levels in the face of demand fluctuations, short lead times, warehouse limitations, and transportation and inventory costs. In particular, transshipment through crossdocks, where just-in-time objectives prevail, requires precise scheduling between suppliers, crossdocks, and customers. In this work, we study the transshipment problem with supplier and customer time windows where flow is constrained by transportation schedules and warehouse capacities. Transportation is provided by fixed or flexible schedules and lot-sizing is dealt with through multiple shipments. We develop polynomial-time algorithms or, otherwise, provide the complexity of the problems studied.

MSC:
90B06 Transportation, logistics and supply chain management
90B05 Inventory, storage, reservoirs
90B35 Deterministic scheduling theory in operations research
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] , , Network flows, Prentice-Hall, Upper Saddle River, NJ, 1993.
[2] Aronson, Ann Oper Res 20 pp 1– (1989)
[3] Axsäter, Management Sci 49 pp 1168– (2003)
[4] Axsäter, European J Oper Res 149 pp 438– (2003)
[5] Bartholdi, Oper Res 48 pp 823– (2000)
[6] , , Staging freight in a crossdock, Proc Int Conf Indust Eng Production Management, Quebec City, Canada, 2001.
[7] Bartholdi, Transportation Sci 38 pp 235– (2004)
[8] Cetinkaya, Management Sci 46 pp 217– (2000)
[9] , , , Schedule-driven crossdocking networks, Research Report, Georgia Institute of Technology, 1999, Atlanta, http://www.isye.gatech.edu/research/files/misc9904.pdf
[10] Fisher, Harvard Bus Rev 72 pp 83– (1994)
[11] , Computers and intractability–a guide to the theory of NP-completeness, Freeman, New York, 1979. · Zbl 0411.68039
[12] Grahovac, Management Sci 47 pp 579– (2001)
[13] , Staging queues in material handling and transportation systems, Proc 2001 Winter Simulation Conf, Arlington, VA, 2001, 1104-1108.
[14] Herer, Naval Res Logist Quart 48 pp 386– (2001)
[15] Herer, Int J Production Econom 80 pp 201– (2002)
[16] , The quickest transshipment problem, Proc Sixth Annu ACM-SIAM Symp Discrete Algorithms, San Francisco, CA, 1995, 1-10.
[17] Kamarkar, Management Sci 33 pp 86– (1987)
[18] Karmarkar, Naval Res Logist Quart 24 pp 559– (1977)
[19] Krishnan, J Indust Eng 16 pp 212– (1965)
[20] , , A dynamic model for inventory lot sizing and outbound shipment consolidation at a third party warehouse, Technical Report, Industrial Engineering Department, Texas A&M University, College Station, TX. 2000
[21] Lee, Management Sci 47 pp 1384– (2001)
[22] Making the move to crossdocking, Warehousing Education and Research Council, Oak Brook IL, 2000.
[23] , , Network design for load-driven cross-docking systems, Research Report, Georgia Institute of Technology, 1999, Atlanta, http://www.isye.gatech.edu/research/files/misc9914.pdf
[24] Robinson, Oper Res 38 pp 278– (1990)
[25] Rudi, Management Sci 47 pp 1668– (2001)
[26] , , Designing and managing the supply chain, 2nd ed., McGraw-Hill-Irwin, Boston, 2003.
[27] Tangaras, IIE Trans 21 pp 250– (1989)
[28] Computing optimal stock levels for common components in an assembly system, working paper, Carnegie-Mellon University, Pittsburgh, PA, 1995.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.