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

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 applicat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical methods of operations research (Heidelberg, Germany) Jg. 75; H. 3; S. 305 - 326
Hauptverfasser: Briskorn, Dirk, Fliedner, Malte
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.06.2012
Springer
Springer Nature B.V
Schlagworte:
Algorithms
Analysis
Business and Management
Calculus of Variations and Optimal Control; Optimization
Combinatorial analysis
Combinatorics
Containers
Cranes & hoists
Materials handling
Mathematical models
Mathematics
Mathematics and Statistics
Operations research
Operations Research/Decision Theory
Optimization
Original Article
Packing problem
Project management
Renewable resources
Scheduling
Stems
Studies
Bin packing
Container yard
Partially renewable resources
Project scheduling
ISSN:1432-2994, 1432-5217
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1432-2994
1432-5217
DOI:10.1007/s00186-012-0386-5