Sorting Last-In-First-Out Stacks

Beschreibung

This thesis deals with storage systems that are organized in last-in-first-out stacks. This approach for storing items is common, for example, in container terminals, and is therefore of great practical interest as well as high relevance in the literature. Furthermore, optimization problems that may arise in this context are presented and addressed by developing novel mathematical model formulations and customized solution methods.

Autor*in

Fabian Wilschewski

Themen in »Sorting Last-In-First-Out Stacks«

Storage Problems With Stacks Block Relocation Problem Premarshalling Problem Mixed Integer Linear Programming Row Generation Method

Stimmen zu »Sorting Last-In-First-Out Stacks«

Details

Link teilen