Skip to main content
Springer Nature Link
Log in

Scheduling Problems in Cross Docking

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2009)

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

  • 1446 Accesses

Abstract

In this paper we study a cross-docking problem minimizing the total flow time of inbound and outbound jobs. Using the theories and methodologies of scheduling, we formulate the problem into a two-stage scheduling problem and propose heuristics with worst-case performance analysis under parallel, uniform and open-shop machines, respectively. For each of problems studied, some polynomially solvable special cases are also introduced.

Supported by the National Science Foundation of China (No. 70731160015) and the National Natural Science Foundation of Jiangsu (Grant No. yw06037).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. Chen, P., Guo, Y.S., Andrew, L.: Multiple Crossdocks with Inventory and Time Windows. Computers and Operations Research 33(1), 43–63 (2006)

    Article  MATH  Google Scholar 

  2. Chen, F., Song, K.L.: Cross Docking Logistics Scheduling Problem and its Approximative and Precise Algorithms. Industrial Engineering and Management 6, 53–58 (2006) (in Chinese)

    Google Scholar 

  3. Donaldson, H., Johnson, E.L., Ratliff, H.D., Zhang, M.: Schedule-Driven Cross-Docking Networks. Technical Report, the Logistics Institute, Georgia Institute of Technology, Atlanta, GA (2003)

    Google Scholar 

  4. Gonzalez, T., Sahni, S.: Open Shop Scheduling to Minimize Finish Time. J. ACM 21, 665–679 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gumus, M., James, H.B.: Cross-Docking and its Implications in Location-Distribution Systems. J. of Business Logistics 25(2), 221–232 (2004)

    Article  Google Scholar 

  6. Heragu, S.S., Jason, C., Huang, S.: A Mathematical Model for Warehouse Design and Product Allocation. International Journal of Production Research 42(4), 122–131 (2003)

    Google Scholar 

  7. Johnson, S.M.: Optimal Two-and Three Stage Production Schedules with Setup Times Included. Naval Research Logistics Quarterly 1, 61–68 (1954)

    Article  MATH  Google Scholar 

  8. Lenstra, J.K., Rinnooy, K.A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. ADM 1, 343–362 (1977)

    MathSciNet  MATH  Google Scholar 

  9. Ma, D.L., Zhang, J.Y., Dai, H.L.: A Controlling Logistics Cost Optimal Model under VMI System. J. of Donghua University 6, 35–39 (2003)

    Google Scholar 

  10. Ratliff, H.D., Vate, J.V., Zhang, M.: Network Design for Load-Driven Cross-Docking Systems[EB/OL]. GIT Technical Report, the Logistics Institute, Georgia Institute of Technology, Atlanta, GA (2003)

    Google Scholar 

  11. Xu, T.L., Luo, S.Y.: The Expected Total Cost Method of Lateral Transshipment in a Cross-Docking System with Stochastic Demand. Industrial Engineering and Management 1, 27–32 (2004) (in Chinese)

    Google Scholar 

  12. Xu, T.L., Xiong, H.: The Method of Searching the Best Time for One-Off Transshipment in a Cross-Docking System with Stochastic Demand. Systems Engineering 9, 23–27 (2004) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Changzhou Institute of Technology, Changzhou, 213002, China

    Rongjun Chen

  2. Department of Mathematics and Information, Ludong University, Yantai, 264025, China

    Baoqiang Fan

  3. Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai, 201209, China

    Guochun Tang

Authors
  1. Rongjun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Baoqiang Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guochun Tang
    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 Texas at Dallas, 800 West Campbell Road, TX 75080-3021, Richardson, USA

    Ding-Zhu Du

  2. Chinese Academy of Sciences, Institute of Applied Mathematics, Zhong Guan Cun Dong Lu 55, 100190, Beijing, P. R. China

    Xiaodong Hu

  3. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, P.O. Box 116595, FL 32611-6595, Gainesville, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, R., Fan, B., Tang, G. (2009). Scheduling Problems in Cross Docking. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02026-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02025-4

  • Online ISBN: 978-3-642-02026-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics