检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:唐韩 刘乐[1] Tang Han;Liu Le(School of Management Science and Engineering,Jinan University,Jinan Shandong 250002,China)
机构地区:[1]济南大学管理科学与工程学院,山东济南250002
出 处:《现代工业经济和信息化》2024年第11期227-230,共4页Modern Industrial Economy and Informationization
基 金:山东省社会科学规划研究项目(22CGLJ02)。
摘 要:基于一批新零件突然到达干扰条件,研究了干扰后被外包出去的初始零件(受扰零件)数量受限,考虑外包选择的SLM单机重调度问题,以内部批处理成本、外包成本及延误成本之和(运作总成本)最小化为目标建立混合整数规划模型。针对某汽车零件增材制造企业的新零件到达干扰下带外包选择的重调度实例开展数值实验。在利用CPLEX Java API对实例的数学模型进行程序化实现的基础上,用时33.08 s得到精确最优解。此外还发现,运作总成本会随受扰零件数上限值的增大而下降,但运作总成本下降速率随之显著变小。Based on the sudden arrival of a batch of new parts to the disturbance condition,the SLM single-machine rescheduling problem considering the outsourcing options is investigated with a limited number of initial parts(disturbed parts)being outsourced out after the disturbance.A mixed-integer planning model is developed with the objective of minimizing the sum of internal batch cost,outsourcing cost and delay cost(total operation cost).Numerical experiments are carried out for an example of rescheduling with outsourcing selection under the new part arrival disruption in an automotive parts additive manufacturing company.Based on the programmatic implementation of the mathematical model of the example using the CPLEX Java API,the exact optimal solution is obtained in 33.08 s.The time required for the implementation of the mathematical model of the example is about 1,000 hours.It is also found that the total operation cost decreases with the increase of the upper limit of the number of disturbed parts,but the rate of decrease of the total operation cost then becomes significantly smaller.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.70.76