Abstract
The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has been to coordinate transshipment activities across the chain aimed at reducing costs and increasing service levels in the face of a range of factors, including demand fluctuations, short lead times, warehouse limitations and transportation and inventory costs. The success in implementing push-pull strategies, when firms change from one strategy to another in managing the chain and where time lines are crucial, is dependent on adaptive transshipment scheduling. Yet again, in transshipment through crossdocks, where just-in-time objectives prevail, precise scheduling between suppliers, crossdocks and customers is required to avoid inventory backups or delays.
This paper studies transshipment with supplier and customer time windows where flow is constrained by transportation schedules and warehouse capacities with the objective to minimize costs, including inventory costs. Transportation is provided through flexible schedules and lot-sizing is dealt with in the models through multiple shipments. We propose polynomial time algorithms or show the complexity of problems studied.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Upper Saddle River (1993)
Aronson, J.E.: A survey on dynamic network flows. Annals of Operations Research 20, 1–66 (1989)
Bartholdi III, J.J., Gue, K.R.: Reducing labor costs in an LTL crossdocking terminal. Operations Research 48(6), 823–832 (2002)
Fisher, M.L., Hammond, J.H., Obermeyer, W.R., Raman, A.: Making supply meet demand in an uncertain world, May-June, pp. 83–93. Harvard Business Review, Boston (1994)
Herer, Y.T., Tzur, M.: The Dynamic Transshipment Problem. Naval Research Logistics 48, 386–408 (2001)
Hoppe, B., Tardos, E.: The quickest transshipment problem. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (1995)
Kamarkar, U.S.: The Multilocation Multiperiod Inventory Problem: Bounds and Approximations. Management Science 33(1), 86–94 (1987)
Karmarkar, U.S., Patel, N.R.: The One-Period N-Location Distribution Problem. Naval Research Logistics 24, 559–575 (1977)
Napolitano, M.: Making the move to crossdocking, Warehousing Education and Research Council (2000)
Robinson, L.W.: Optimal and approximate policies in multiperiod, multilocation inventory models with transshipments. Operations Research 38, 278–295 (1990)
Rudi, N., Kapur, S., Pyke, D.F.: A two-location inventory model with transshipment and local decision making. Management Science 47, 1668–1680 (2001)
Simchi-Levi, D., Kaminsky, P., Simchi-Levi, E.: Designing and Managing the Supply Chain, 2nd edn. McGraw-Hill - Irwin Publishers, New York (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, A., Miao, Z., Rodrigues, B., Xu, Z. (2004). Transshipment Through Crossdocks with Inventory and Time Windows. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive