检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]同济大学经济与管理学院,上海200092 [2]复旦大学管理学院,上海200443
出 处:《工业工程与管理》2007年第2期61-64,共4页Industrial Engineering and Management
摘 要:将在线与店内顾客购物冲突引起的通道拥塞问题简化为排队等待时间优化问题,以订单在店内的最大等待时间最小化为目标,利用M|M|1排队系统建立了排队论优化模型。算例分析显示:在最优解中,该模型试图令所有的商店均达到工作载荷均衡,从而在配送预算范围内的任意时刻拥塞程度均可达到最小化。在敏感度分析中,最优等待时间与成本预算和总利用率两个变量密切相关,即当配送预算和总利用率达到某个特定值后,再次下降时,等待时间将分别发生显著增加和减少,这将对系统的绩效产生负面影响。The store congestion, resulting from the pick-up conflict between online and instore orders in E-Grocery shopping environment, is switched to the optimization problem with regard to order-picking waiting time. Therefore, aiming to minimize the maximal waiting time of order picking in Brick and Click E-Grocery shop, this paper sets up an optimization model by using M|M|1 theory of queuer. Then, a base case shows that the model attempts to achieve equity of workload among all stores thus minimising the chances of congestion at any one while staying within the delivery budget in the optimal solution. In the sensitivity analysis, the optimal waiting time is closely correlative with delivery budget and utilisation factor, that is to say, once the latter drop after the delivery cost and utilisation factor up to some special value, corresponding waiting time will respectively increase and decrease significantly, which will have a negative impact on performance of EGS.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.59