Skip to main content
Log in

Scheduling train loading with straddle carriers in container yards

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper considers a scheduling problem occurring in the hinterland of many medium-sized container ports. Here, containers from a storage yard need to be loaded onto freight trains by straddle carriers (SCs). The main complicating fact in the resulting train loading problem with straddle carriers (TLSC) is that the track provides only one-sided access and while straddling the train SCs cannot pass each other. This paper introduces the TLSC with two different policies to avoid obstructions of SCs in the track lane, settles computational complexity, and compares both policies in a comprehensive computational study.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7

Similar content being viewed by others

References

  • Bierwirth C and Meisel F (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 202 (3): 615–627.

    Article  Google Scholar 

  • Blazewicz J, Dell'Olmo P and Drozdowski M (1999). Scheduling of client-server applications. International Transactions in Operational Research 6 (4): 345–363.

    Article  Google Scholar 

  • Boysen N and Fliedner M (2010). Determining crane areas in intermodal transshipment yards: The yard partition problem. European Journal of Operational Research 204 (2): 336–342.

    Article  Google Scholar 

  • Boysen N, Fliedner M and Kellner M (2010). Determining fixed crane areas in rail-rail transshipment yards. Transportation Research Part E: Logistics and Transportation Review 46 (6): 1005–1016.

    Article  Google Scholar 

  • Brinkmann B (2011). Operations systems of container terminals: A compendious overview. In: Böse JW (ed). Handbook of Terminal Planning. Springer: Berlin.

    Google Scholar 

  • Garey MR and Johnson DS (1978). ‘Strong’ NP-completeness results: Motivation, examples, and implications. Journal of the Association for Computing Machinery 25 (3): 499–508.

    Article  Google Scholar 

  • Garey MR and Johnson DS (1979). Computers and Intractability. W.H. Freeman: New York.

    Google Scholar 

  • Hulett H, Will TG and Woeginger GJ (2008). Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. Operations Research Letters 36 (5): 594–596.

    Article  Google Scholar 

  • Jeong BJ and Kim KH (2011). Scheduling operations of a rail crane and container deliveries between rail and port terminals. Engineering Optimization 43: 597–613.

    Article  Google Scholar 

  • Stahlbock R and Voß S (2008). Operations research at container terminals: A literature update. OR Spectrum 30 (1): 1–52.

    Article  Google Scholar 

  • Steenken D, Voß S and Stahlbock R (2004). Container terminal operation and operations research—A classification and literature review. OR Spectrum 26 (1): 3–49.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N Boysen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boysen, N., Emde, S. & Fliedner, M. Scheduling train loading with straddle carriers in container yards. J Oper Res Soc 64, 1841–1850 (2013). https://doi.org/10.1057/jors.2012.160

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2012.160

Keywords

Navigation