Results 221 to 230 of about 61,618 (264)

Optimal storage assignment policies for multiaddress warehousing systems

IEEE Transactions on Systems, Man, and Cybernetics, 1989
The 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, Bhaskaran Krishnakumar   +1 more
openaire   +1 more source

Storage location assignment in a distribution center

International Journal of Physical Distribution & Logistics Management, 2000
Considering 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

An active storage system with dynamic task assignment policy

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2016
As 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, Zaihong He, Huailiang Tan   +2 more
openaire   +1 more source

Near-optimal heuristics for an assignment problem in mass storage

International Journal of Computer & Information Sciences, 1975
This 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   +3 more sources

Optimization of Storage Location Assignment for Fixed Rack Systems

2010
A multi-objective mathematical model and an improved Genetic Algorithm (GA) are formulated for storage location assignment of the fixed rack system. According to the assignment rules, the optimization aim is to maximize the storage/retrieval efficiency and to keep the stability of the rack system.
Qinghong Wu, Ying Zhang, Zongmin Ma 0001
openaire   +1 more source

Safety storage assignment in as/rs

2013
Picking time reduction has been the traditional perspective for warehouse optimization. When structural safety is considered, optimization of warehouse operations should be read even in terms of load mass distribution. In many practical cases the static safety of the system is related to mass distribution and barycenter highness, for example when a ...
DAVOLI, Giovanni, GOVONI, Andrea, GALLO, Sergio Amedeo, Bortoli, Erika, MELLONI, Riccardo   +4 more
openaire   +1 more source

Storage utilization in a memory hierarchy when storage assignment is performed by a hashing algorithm

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   +3 more sources

A Balance Storage Nodes Assignment for Wireless Sensor Networks

2013
A balance storage nodes assignment problem is proposed for wireless sensor networks in order to save history data as much as possible when the network cannot connect to the sink node(s). Its aim is to assign storage nodes as evenly as possible to each source node, while it can minimize the storage path cost of the whole network.
Zhigang Li, Geming Xia, Weiwei Chen, Qing Li   +3 more
openaire   +2 more sources

Storage Optimization through Offset Assignment with Variable Coalescing

ACM Transactions on Embedded Computing Systems, 2012
Most 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   +2 more sources

A Storage Assignment Model for Batch Preparation in Process Industries

SSRN Electronic Journal, 2010
PurposeThe purpose of this paper is to develop new model formulation for reducing the workload in pre‐batching at a manufacturer of flavors and fragrances, by optimally assigning ingredients to different storage types, taking into account past usage of ingredients and several restrictions about volumes and number of storage units.Design/methodology ...
Ashayeri, J, Selen, Willem
openaire   +3 more sources