检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘晓鹏 陈庆新[1] 毛宁[1] 张惠煜 LIU Xiaopeng;CHEN Qingxin;MAO Ning;ZHANG Huiyu(Key Laboratory of Computer Integrated Manufacturing System of Guangdong Province,Guangdong University of Technology,Guangzhou 510006,China)
机构地区:[1]广东工业大学广东省计算机集成制造系统重点实验室,广东广州510006
出 处:《计算机集成制造系统》2023年第4期1218-1229,共12页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(51805096,51775120,61973089,71802055);广东省自然科学基金资助项目(2022A1515011175,2022A1515010991);广州市科技计划资助项目(2023A04J0406)。
摘 要:针对多层单元流水式车间,着重考虑其运输资源共享的特点,研究该车间的排队网建模方法。首先,定义不同任务的可能场景及其发生概率,采用两矩近似法描述任务节点的服务时间;其次,提出一种混合排队网模型处理车间中的同步性约束问题,并根据这些约束建立模型中各节点的关系,考虑一般分布和有限缓存区,通过迭代近似求解系统的性能指标;最后,设计了一系列的算例实验并与仿真结果对比,验证了假设模型的有效性和求解方法的精确性,并分析运输设备和缓存区对系统性能的影响,为该类生产车间的资源配置和布局规划等问题提供重要的理论支撑。Focused on the multi-floor flow shop,considering the synchronization constraint of its public transportation resources,the modeling method of the workshop queuing network was studied.The possible scenario of different tasks and their probability of occurrence were defined,and the service time of the task nodes were described by the two-moment approximation method.The resource constraints problem was modelled as a queuing network model and an iterative algorithms was proposed to compute the system performance with the general distribution and limited buffer capacity.Finally,the efficiency of the hypothetical model and the accuracy of the solution method were tested through the comparison of the example experiment and the simulation results.This research could provide important theoretical support for the resource allocation and facility layout of this kind of the flow shop.
关 键 词:多层车间 共享资源 排队网 同步性约束 系统性能
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.74