混合算法求解两阶段装配流水车间调度
首发时间:2017-07-14
摘要:生产计划和调度是制造企业的核心问题,工件的延迟或提前会带来额外库存、价格变动、产品损耗等多种问题。本文基于准时化模式的生产理念,研究考虑机器准备时间的两阶段装配流水车间的工件最佳排序问题。以最小化最大拖期和提前期为目标函数,提出了一种遗传变邻域搜索算法。该算法将遗传算法求得的最优解作为变邻域搜索的初始解,利用变邻域搜索较好的局部搜索能力进行精细搜索,以提高算法的求解质量。通过仿真实验和算法比较验证了遗传变邻域搜索算法的有效性。
关键词: 两阶段装配流水车间调度 准备时间 准时化 遗传变邻域搜索算法 田口设计
For information in English, please click here
A Hybrid Algorithm for Solving Two-stage Assembly Flowshop scheduling
Abstract:Production planning and scheduling is the core problem of manufacturing companies, and tardiness and earliness may induce numerous problems, i.e. extra storage, prince changing, risk of damages, etc. For two-stage assembly flowshop scheduling problem, based on the JIT philosophy, we study the problem with setup times to achieve the optimum scheduling. In order to realize the goal of minimizing the sum of tardiness and earliness, a HGA-VNS (hybrid genetic algorithm-variable neighborhood search) is proposed. The optimum solution obtained by GA is utilized to the initial solution of VNS. With the help of the good local search ability of the VNS, the initial solution is improved. We use computational experiments and algorithm comparisons to demonstrate the effectiveness of HGA-VNS.
Keywords: two-stage assembly flowshop scheduling setup times JIT hybrid genetic algorithm-variable neighborhood search Taguchi method
论文图表:
引用
No.4738725120133514****
同行评议
共计0人参与
勘误表
混合算法求解两阶段装配流水车间调度
评论
全部评论0/1000