检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:游勇 李明伟 许佩 张胜利 鲁瑞 郭华诚 YOU Yong;LI Mingwei;XU Pei;ZHANG Shengli;LU Rui;GUO Huacheng(Henan China Tobacco Industry Co.,Ltd.,Zhengzhou 450004,China)
出 处:《包装工程》2024年第17期149-155,共7页Packaging Engineering
基 金:河南中烟工业有限责任公司科技项目(AW202171)。
摘 要:目的卷烟车间是卷烟生产中的重要环节,其生产效率的高低直接关系到企业的经济效益和市场竞争力。车间调度是卷烟车间生产过程中的关键环节,通过优化生产资源,提高生产效率和经济效益,从而保证产品质量和生产周期。方法通过建立数学模型,描述车间的生产流程,运用优化技术求解模型,以最小化任务完成时间为优化目标。结合车间实际情况,采用改进遗传算法进行求解。结果经优化后,最大完工时间的最小值为614,在90代左右进入收敛状态。结论验证了优化算法在解决车间调度问题中的有效性和实用性,优化后的调度方案可以大幅提高车间生产效率、降低生产成本。The cigarette workshop plays an important role in cigarette production,and its production efficiency is directly related to the economic benefits and market competitiveness of enterprises.Workshop scheduling is a key issue in the production process of the cigarette workshop.The work aims to optimize production resources to improve production efficiency and economic benefits,thus ensuring product quality and production cycle.By establishing a mathematical model,the production process of the workshop was described and the optimization techniques were adopted to solve the model,with the optimization goal of minimizing task completion time.Combined with the actual situation of the workshop,an improved genetic algorithm was used to solve the problem.The optimal maximum completion time was minimized to 614,entering a convergence state around the 90th generation.The effectiveness and practicality of the optimization algorithm in solving workshop scheduling problems have been verified.The optimized scheduling scheme can significantly improve workshop production efficiency and reduce production costs.
分 类 号:TP319[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49