Cargando…
Ramping up a heuristic procedure for storage location assignment problem with precedence constraints
The retail industry is becoming increasingly competitive; as a result, companies are seeking to reduce inefficiencies in their supply chains. One way of increasing the efficiency of operations inside a warehouse is by better allocating products in the available spaces. In this paper, we propose a ne...
Autores principales: | Trindade, Maria A. M., Sousa, Paulo S. A., Moreira, Maria R. A. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8210510/ https://www.ncbi.nlm.nih.gov/pubmed/34155445 http://dx.doi.org/10.1007/s10696-021-09423-w |
Ejemplares similares
-
Heuristic Algorithms for Assigning Hispanic Ethnicity
por: Boscoe, Francis P., et al.
Publicado: (2013) -
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems
por: Moreno-Scott, Jorge Humberto, et al.
Publicado: (2016) -
An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
por: Sung, Jinmo, et al.
Publicado: (2014) -
Dataset on a problem of assigning activities to children, with various optimization constraints
por: Varone, Sacha, et al.
Publicado: (2019) -
Ramp and squeeze procedures for LEP2
por: Poole, John
Publicado: (1993)