期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到2篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Optimization of Agricultural Bank of China’s “Smart Welcome” System Based on Queuing Algorithm: Taking HL Branch as a Case Study 认领 引用
1
作者 Shuai Liu Peicong Wu 《Proceedings of Business and Economic Studies》 2025年第8期100-105,共6页
This study selects the“Smart Welcome”system of Agricultural Bank of China as a research case,aiming to improve the service efficiency and quality of Agricultural Bank of China’s branches through system optimization... This study selects the“Smart Welcome”system of Agricultural Bank of China as a research case,aiming to improve the service efficiency and quality of Agricultural Bank of China’s branches through system optimization based on queuing algorithm.It first provides a systematic review of queuing theory and performance evaluation of queuing systems,to provide basic theoretical support for the improvement strategies of the“smart welcome”system in the bank queuing process system.Through a detailed analysis of the“Smart Welcome”system,covering its definition,workflow,existing channel information collection capabilities and customer service characteristics,it proposes a novel queuing algorithm application for optimizing the system’s efficiency and bank processes in response to identified problems.The optimization aims to enhance the service efficiency of bank outlets,providing references and suggestions to support the improvement of bank service efficiency. 展开更多
关键词 “Smart Welcome”system Queuing theory Queuing algorithm Service efficiency Bank branch service optimization
暂未订购 下载PDF
Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System 认领 引用 被引量：10
2
作者 WANG Yanyan MOU Shandong WU Yaohua 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2016年第2期421-429,共9页
The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retri... The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center. 展开更多
关键词 Multi-tier shuttle warehousing system storage assignment optimization open queuing network ant colony clustering algorithm
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈