Skip to main content
SpringerLink
Log in

Packing chained items in aligned bins with applications to container transshipment and project scheduling

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

Bin packing problems are at the core of many well-known combinatorial optimization problems and several practical applications alike. In this work we introduce a novel variant of an abstract bin packing problem which is subject to a chaining constraint among items. The problem stems from an application of container handling in rail freight terminals, but is also of relevance in other fields, such as project scheduling. The paper provides a structural analysis which establishes computational complexity of several problem versions and develops (pseudo-)polynomial algorithms for specific subproblems. We further propose and evaluate simple and fast heuristics for optimization versions of the problem.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Böttcher J, Drexl A, Kolisch R, Salewski F (1999) Project scheduling under partially renewable resource constraints. Manage Sci 45: 543–559

    Article  MATH  Google Scholar 

  • Boysen N, Fliedner M (2010) Determining crane areas in intermodal transshipment yards: the yard partition problem. Eur J Oper Res 204: 336–342

    Article  MATH  Google Scholar 

  • Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44: 145–159

    Article  MathSciNet  MATH  Google Scholar 

  • Garey M, Johnson D (1979) Computers and intractability. Freeman, New York

    MATH  Google Scholar 

  • Goldberg A, Tarjan R (1988) A new approach to the maximum flow problem. J ACM 35: 921–940

    Article  MathSciNet  MATH  Google Scholar 

  • Gupta U, Lee D, Leung J-T (1982) Efficient algorithms for interval graphs and circular-arc graphs. Networks 12: 459–467

    Article  MathSciNet  MATH  Google Scholar 

  • Hartmann S, Briskorn D (2010) A survey of deterministic modeling approaches for project scheduling under resource constraints 207:1–14

  • Kellner M, Boysen N, Fliedner M (2011) How to park freight trains on railrail transshipment yards: the train location problem. Oper Res Spectrum (to appear)

  • Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141: 241–252

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Siegen, Hölderlinstr. 3, 57076, Siegen, Germany

    Dirk Briskorn

  2. Technische Universität Darmstadt, Hochschulstrasse 1, 64289, Darmstadt, Germany

    Malte Fliedner

Authors
  1. Dirk Briskorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malte Fliedner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dirk Briskorn.

Additional information

This work has been in part supported by the German Science Foundation (DFG) through the grant “Optimierung der Containerabfertigung in Umschlagbahnhöfen” (BO 3148/1-1 and PE 514/16-1).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Briskorn, D., Fliedner, M. Packing chained items in aligned bins with applications to container transshipment and project scheduling. Math Meth Oper Res 75, 305–326 (2012). https://doi.org/10.1007/s00186-012-0386-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-012-0386-5

Keywords

Search

Navigation