A bottleneck assignment approach to the multiple container loading problem

DOI10.1007/s002910200113zbMath1035.90070OpenAlexW3135276079MaRDI QIDQ1871842

M. Eley

Publication date: 4 May 2003

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002910200113

zbMATH Keywords

PackingContainer loadingAdditional constraintsBottleneck assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem ⋮ A heuristic for solving large bin packing problems in two and three dimensions ⋮ The multiple container loading problem with preference ⋮ An improved typology of cutting and packing problems ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading problem with loading docks ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ The multiple container loading cost minimization problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Three-dimensional container loading models with cargo stability and load bearing constraints ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ The exact solutions of several types of container loading problems ⋮ Constraints in container loading -- a state-of-the-art review