Formulations for joint order picking problems in low-level picker-to-part systems
This article introduces several mathematical formulations for the joint order picking problem (JOPP) in low-level picker-to-part warehousing systems. In order to represent real warehousing environments, the proposed models minimize performance measures such as travel distance, travel time and tardin...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2020
- Institución:
- Universidad de Medellín
- Repositorio:
- Repositorio UDEM
- Idioma:
- eng
- OAI Identifier:
- oai:repository.udem.edu.co:11407/5959
- Acceso en línea:
- http://hdl.handle.net/11407/5959
- Palabra clave:
- Batch sequencing
Mathematical programming
Order batching
Order picking
Picker routing fourth
- Rights
- License
- http://purl.org/coar/access_right/c_16ec
| Summary: | This article introduces several mathematical formulations for the joint order picking problem (JOPP) in low-level picker-to-part warehousing systems. In order to represent real warehousing environments, the proposed models minimize performance measures such as travel distance, travel time and tardiness, considering multi-block warehouses, due dates, and multiple pickers. The number of constraints and decision variables required for each proposed model is calculated, demonstrating the complexity of solving medium and long-sized problems in reasonable computing time using exact methods, so it is still recommendable to solve these JOPP using metaheuristics. The proposed models can be followed as a reference for new solution methods that yield efficient and fast solutions. © 2020, Institute of Advanced Engineering and Science. All rights reserved. |
|---|