A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
Year of publication: |
2024
|
---|---|
Authors: | Barbato, Michele ; Ceselli, Alberto ; Righini, Giovanni |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 27.2024, 4, p. 393-407
|
Subject: | Artificial Intelligence | Combinatorial optimization | Crane scheduling | Dynamic programming | Polynomial-time algorithm | Dynamische Optimierung | Künstliche Intelligenz | Artificial intelligence | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Outcome-driven dynamic refugee assignment with allocation balancing
Bansak, Kirk, (2024)
-
A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
Faye, Alain, (2018)
-
Adaptive solution prediction for combinatorial optimization
Shen, Yunzhuang, (2023)
- More ...
-
Mathematical programming for simultaneous feature selection and outlier detection under l1 norm
Barbato, Michele, (2024)
-
On the impact of resource relocation in facing health emergencies
Barbato, Michele, (2023)
-
The Hamiltonian p-median problem : polyhedral results and branch-and-cut algorithms
Barbato, Michele, (2024)
- More ...