Results 21 to 30 of about 205 (191)
International Journal of Production Research, 2021 In this work, we address the Order Batching Problem (OBP) and we devise tailor-made Mixed Integer Linear Programming (MILP) formulations of the OBP considering composite, largest gap and optimum routing policies, for the first time. We also introduce a novel picker routing policy named as mixed policy which combines the properties of both midpoint and ...
Ufuk Bahçeci, Temel Öncan
openaire +4 more sources
A cloud-based location assignment system for packaged food allocation in e-fulfillment warehouse
International Journal of Engineering Business Management, 2016 E-retailing is the delivery of products and services over the Internet, and it has been growing rapidly in recent years. Logistics services in the related warehouses have to be enhanced accordingly in order to handle the huge amount of e-orders in a ...
Yasmin YY Hui +4 more
doaj +1 more source
IEEE Access, 2020 This paper considers heuristic approaches that can be used to assign stock keeping units (SKU) to individual slots in distribution center. Firstly, we propose two novel strategies, slot selection and frequent itemset grouping.
Junwoo Kim +2 more
doaj +1 more source
Defining a Storage-assignment Strategy for Precedence-constrained Order Picking
Operations Research and Decisions, 2021 A zero-one quadratic assignment model has been proposed for dealing with the storage location assignment problem when there are weight constraints. Our analysis shows that operations can be improved using our model.
Maria A.M. Trindade +2 more
doaj
Storage design using Fast moving, Slow moving and Non moving (FSN) analysis
MATEC Web of Conferences, 2018 Storage location assignment is related to the problem in warehousing management. The purpose of this paper is to gain storage allocations of goods in a warehouse based on the fast moving, slow moving and non moving (FSN) analysis as the determination of ...
Tambunan Mangara M +4 more
doaj +1 more source
MathematicsRecognized as an NP-hard combinatorial challenge, Storage Location Assignment Problem (SLAP) demands heuristic or algorithmic solutions for effective optimization.
Kitti Udvardy +3 more
doaj +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
A Simulated Annealing Algorithm for the Generalized Quadratic Assignment Problem
AlgorithmsThe generalized quadratic assignment problem (GQAP) involves assigning a set of facilities to a set of locations such that the sum of the assignment and transportation costs is minimized.
Alan McKendall, Yugesh Dhungel
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio +8 more
wiley +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source