调整时间与顺序相关的能耗优化调度问题  

Energy Consumption Optimization Scheduling Problem with Sequence-Dependent Setup Times

作　　者：李冰[1] 黎展滔[1] 

机构地区：[1]广东工业大学机电工程学院,广东广州510006

出　　处：《机电工程技术》2015年第6期12-16,共5页Mechanical & Electrical Engineering Technology

基　　金：广东省自然科学基金资助项目(编号:501130093);粤港澳领域重点突破项目(编号:2012A080107017)

摘　　要：以陶瓷行业车间生产计划为背景,将其抽象为调整时间与顺序相关的能耗优化调度问题进行研究。以最少化总能耗为目标,建立数学模型;提出了基于NEH算法的混合遗传算法,其中初始化种群中,定义了虚拟工件概念,采用了改进NEH规则对种群初始化;为了对上述算法进行验证,提出了该问题的两个下界,设计了仿真试验,进行下界背离程度分析和CPU运行时间分析。计算结果表明:所设计的混合遗传算法能够在可接受的计算时间内获得合理的解。This paper considers ceramic industry workshop production plan as the background, abstract that to energy consumption optimization scheduling problem with two types of sequence-dependent setup times to study. To minimize the total energy consumption as the goal,establishment of mathematical model. The hybrid genetic algorithm is proposed based on NEH algorithm,in the initialization of population, defines the concept of virtual work, using the improved NEH rules for population initialization. Two lower bounds are proposed to evaluate the algorithms. A computational experiment is developed to lower bounds degree of deviation analysis and CPU running times analysis. The analysis reveals that designed by hybrid genetic algorithm can be acquired within an acceptable computation time reasonable solution.

关 键 词：柔性流水车间 调整时间与顺序相关 遗传算法 能耗优化 

分 类 号：TH165[机械工程—机械制造及自动化] TP301[自动化与计算机技术—计算机系统结构]