期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
医院消毒供应室外包决策分析 被引量:5
1
作者 魏妍炘 《卫生经济研究》 北大核心 2018年第8期64-66,共3页
近年来医院后勤业务外包发展迅速,全面准确的成本分析有助于有效控制外包成本,为医院是否外包以及确定外包价格提供决策参考。本文通过分析某三级甲等医院消毒供应室运行成本,基于全成本角度构建了外包和改扩建方案的定量决策模型,具体... 近年来医院后勤业务外包发展迅速,全面准确的成本分析有助于有效控制外包成本,为医院是否外包以及确定外包价格提供决策参考。本文通过分析某三级甲等医院消毒供应室运行成本,基于全成本角度构建了外包和改扩建方案的定量决策模型,具体讨论了各种场地机会成本下的医院外包策略。 展开更多
关键词 医院消毒供应室 外包 运行成本法 场地机会成本
下载PDF
Task Assignment Problem of Robots in a Smart Warehouse Environment 被引量:1
2
作者 Zhenping Li Wenyu Li Lulu Jiang 《Management Studies》 2016年第4期167-175,共9页
The task assignment problem of robots in a smart warehouse environment (TARSWE) based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task ass... The task assignment problem of robots in a smart warehouse environment (TARSWE) based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task assignment problem for picking one order is formulated into a mathematical model to minimize the total operation cost. Then a heuristic algorithm is designed to solve the task assignment problem for picking multiple orders. Finally, simulations are done by using the orders data of online bookstore A. The results show that using the heuristic algorithm of this paper to assign robots, the cost was reduced by 2% and it can effectively avoid far route and unbalanced workload of robots. The feasibility and validity of the model and algorithm are verified. The model and algorithm in this paper provide a theoretical basis to solve the TARSWE. 展开更多
关键词 smart warehouse ROBOTS cargo-to-person task assignment mathematical model heuristic algorithm
下载PDF
Research on Parallel K-Medoids algorithm based on MapReduce
3
作者 Xianli QIN 《International Journal of Technology Management》 2015年第1期26-28,共3页
In order to solve the bottleneck problem of the traditional K-Medoids clustering algorithm facing to deal with massive data information at the time of memory capacity and processing speed of CPU, the paper proposed a ... In order to solve the bottleneck problem of the traditional K-Medoids clustering algorithm facing to deal with massive data information at the time of memory capacity and processing speed of CPU, the paper proposed a parallel algorithm MapReduce programming model based on the research of K-Medoids algorithm. This algorithm increase the computation granularity and reduces the communication cost ratio based on the MapReduce model. The experimental results show that the improved parallel algorithm compared with other algorithms, speedup and operation efficiency is greatly enhanced. 展开更多
关键词 K-Medoids MAPREDUCE Parallel computing HADOOP
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部