Results 261 to 270 of about 60,355 (305)
Some of the next articles are maybe not open access.
Sustainable storage assignment and dwell-point policies for automated storage and retrieval systems
Production Planning & Control, 2011Picking time reduction has been the traditional perspective for warehouse optimisation. When sustainability is considered, optimisation of warehouse operations should be read in terms of energy efficiency other than response time. Each location in the rack of an automated storage and retrieval system is associated with the value of energy consumed by ...
MENEGHETTI, Antonella, MONTI, Luca
openaire +2 more sources
Automated warehouse storage assignment policy based on storage frequency and workload balance
2016 International Conference on Logistics, Informatics and Service Sciences (LISS), 2016Storage assignment policy will directly affect the order-picking efficiency and logistics cost in an automated warehouse. Based on the traditional storage assignment policies which are focused on the storage frequency, we take workload balance into consideration and propose two new storage assignment policies for the automated warehouse.
Jinwen Cai +3 more
openaire +1 more source
Solving the Storage Location Assignment Problem Using Reinforcement Learning
Proceedings of the 2023 8th International Conference on Mathematics and Artificial Intelligence, 2023Abstract: In this work, we deal with the Storage Location Assignment Problem, often referred to as the SLAP, in an E-commerce Distribution Center (EDC). With E-commerce steadily increasing in popularity over the past decades, it has become a key part of the logistics industry.
Arne Troch +2 more
openaire +2 more sources
Storage location assignment in a distribution center
International Journal of Physical Distribution & Logistics Management, 2000Considering a relay order pick system in a distribution center, proposes a heuristic method based on historical customers’ orders for assigning products into storage zones, and constructs a performance index for measuring the continuity of each order handled in the pick system.
openaire +1 more source
Optimal storage assignment policies for multiaddress warehousing systems
IEEE Transactions on Systems, Man, and Cybernetics, 1989The authors investigate the optimal storage assignment policy for a multiaddress warehousing system using a dedicated storage discipline and aisle captive, man-aboard vehicles performing item retrieval. A modeling scenario is presented which is designed to reflect warehousing practices emphasizing short-order picking cycle times and integrated ...
Charles J. Malmborg +1 more
openaire +1 more source
Storage Optimization through Offset Assignment with Variable Coalescing
ACM Transactions on Embedded Computing Systems, 2012Most modern digital signal processors (DSPs) provide multiple address registers and a dedicated address generation unit (AGU) which performs address generation in parallel to instruction execution. There is no address computation overhead if the next address is within the auto-modify range.
Hassan A. Salamy, J. Ramanujam
openaire +1 more source
Communications of the ACM, 1971
The utilization of storage is studied in a two-level memory hierarchy. The first storage level, which is the fast store, is divided into a number of storage areas. When an entry is to be filed in the hierarchy, a hashing algorithm will attempt to place the entry into one of these areas.
openaire +2 more sources
The utilization of storage is studied in a two-level memory hierarchy. The first storage level, which is the fast store, is divided into a number of storage areas. When an entry is to be filed in the hierarchy, a hashing algorithm will attempt to place the entry into one of these areas.
openaire +2 more sources
An active storage system with dynamic task assignment policy
2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2016As the amount of data grows exponentially, active storage was proposed as an alternative solution in order to mitigate the I/O performance problem in distributed cluster system. It moves appropriate computation to the location in which data is stored and hence reduces the amount of data transferred.
Shuangquan Fan +2 more
openaire +1 more source
Near-optimal heuristics for an assignment problem in mass storage
International Journal of Computer & Information Sciences, 1975This paper deals with the assignment of items to an array based on access probabilities so that the expected access time is minimized. The only necessary condition for optimality known to date is that of pairwise majorization. This condition, however, is far from being sufficient.
P. C. Yue, C. K. Wong
openaire +2 more sources
A Precious Mess: On the Scattered Storage Assignment Problem
2017Induced by the rise of online retailing new storage strategies have evolved, designed to meet the demands of e-commerce warehousing. Although many of these new approaches have established over the last few years, literature on basic planning problems in these environments can be found only rarely.
openaire +1 more source