检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宁克 刘志伟[1] 侯滨 NING Ke;LIU Zhiwei;HOU Bin(State Grid Shanxi materials company,Taiyuan 030006,China;Shanxi University of Finance and Economics,Taiyuan 030006,China)
机构地区:[1]国网山西物资公司,山西太原030006 [2]山西财经大学,山西太原030006
出 处:《电子设计工程》2024年第8期134-138,共5页Electronic Design Engineering
基 金:国网山西省电力公司科技项目资助(5204A121000W)。
摘 要:在全渠道供应链网络中,资源请求被阻塞,出现资源调度拥挤现象,导致调度时间变长,影响整体调度效率。因此,提出了全渠道供应链网络节点约束存储转发调度方法。根据搭建网络节点约束存储转发调度框架,计算资源请求阻塞概率,利用时移多层图法实现空间和时间资源请求指令的双向传送,避免出现请求阻塞问题。构建调度决策目标函数,调整网络节点约束存储转发顺序,确定供应链网络节点约束下存储转发成功率,实现节点约束存储转发调度。实验结果可知,该方法调度时长最短为30 s,且调度路径与预先设定路径吻合,具有高效调度效果。In an omnichannel supply chain network,resource requests are blocked,resulting in resource scheduling congestion,resulting in longer scheduling time and affecting the overall scheduling efficiency.Therefore,a node constrained store-and-forward scheduling method for omni-channel supply chain network is proposed.According to the establishment of the network node constrained stora-and-forward scheduling framework,the resource request blocking probability is calculated,and the two-way transmission of space and time resource request instructions is realized by using the time-shift multi-layer graph method to avoid the request blocking problem.Build the scheduling decision objective function,adjust the stora-and-forward order constrained by the network nodes,determine the stora-and-forward success rate under the supply chain network node constraints,and realize the stora-and-forward scheduling constrained by the nodes.The experimental results show that the shortest scheduling time of this method is 30 s,and the scheduling path is consistent with the preset path,which has an efficient scheduling effect.
分 类 号:TN915.08[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.22.42.14