Automated warehouse expedition scheduling
Rozvrhování vyskladňování z automatizovaného skladu
Authors
Supervisors
Reviewers
Editors
Other contributors
Journal Title
Journal ISSN
Volume Title
Publisher
České vysoké učení technické v Praze
Czech Technical University in Prague
Czech Technical University in Prague
Date
Abstract
Tato práce se zabýva optimalizací problému rozvrhování denní expedice v automatizovaném skladu s důrazem na robustnost a vyhovění daným požadavkům. Problém zahrnuje přiřazení kamionů na rampy a naplánovaní vyskladnění předem daných produktů. Představujeme relevatní problémy rozvrhování a způsoby jejich řešení. Metoda pro evaluaci rozvrhu je poté prezentována společně s heuristic construction metodou v kombinaci s lokálním prohledáváním. Kombinace těchto metod je navržena k tvorbě rozvrhu expedicí. Navržená metoda je implementována v dodaném simulátoru a vzniklý rozvrh je evaluován na základě výsledků ze simulace.
This thesis deals with the optimization problem of daily expedition scheduling in an automated warehouse with a focus on robustness and satisfaction of given requirements. The problem consists of a truck allocation to expedition ramps and scheduling of unloading of predetermined products. We introduce related scheduling problems and the methods to solve them. Our method for schedule evaluation is then presented together with the proposed heuristic construction method in combination with local search techniques. Finally, the proposed method is implemented in the provided simulation tool, and constructed schedule is evaluated based on results from the simulation. Results from the simulation show that the proposed method generates a schedule that satisfies given requirements and is relatively robust to delays.
This thesis deals with the optimization problem of daily expedition scheduling in an automated warehouse with a focus on robustness and satisfaction of given requirements. The problem consists of a truck allocation to expedition ramps and scheduling of unloading of predetermined products. We introduce related scheduling problems and the methods to solve them. Our method for schedule evaluation is then presented together with the proposed heuristic construction method in combination with local search techniques. Finally, the proposed method is implemented in the provided simulation tool, and constructed schedule is evaluated based on results from the simulation. Results from the simulation show that the proposed method generates a schedule that satisfies given requirements and is relatively robust to delays.