Mathematical Methods of Operations Research

, Volume 75, Issue 3, pp 305–326 | Cite as

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

Original Article

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.

Keywords

Bin packing Container yard Project scheduling Partially renewable resources 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Böttcher J, Drexl A, Kolisch R, Salewski F (1999) Project scheduling under partially renewable resource constraints. Manage Sci 45: 543–559MATHCrossRefGoogle Scholar
  2. Boysen N, Fliedner M (2010) Determining crane areas in intermodal transshipment yards: the yard partition problem. Eur J Oper Res 204: 336–342MATHCrossRefGoogle Scholar
  3. Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44: 145–159MathSciNetMATHCrossRefGoogle Scholar
  4. Garey M, Johnson D (1979) Computers and intractability. Freeman, New YorkMATHGoogle Scholar
  5. Goldberg A, Tarjan R (1988) A new approach to the maximum flow problem. J ACM 35: 921–940MathSciNetMATHCrossRefGoogle Scholar
  6. Gupta U, Lee D, Leung J-T (1982) Efficient algorithms for interval graphs and circular-arc graphs. Networks 12: 459–467MathSciNetMATHCrossRefGoogle Scholar
  7. Hartmann S, Briskorn D (2010) A survey of deterministic modeling approaches for project scheduling under resource constraints 207:1–14Google Scholar
  8. 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)Google Scholar
  9. Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141: 241–252MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  1. 1.Universität SiegenSiegenGermany
  2. 2.Technische Universität DarmstadtDarmstadtGermany

Personalised recommendations