具有后成组约束的两阶段柔性流水作业计划制订的启发式算法  

Heuristic Algorithm for Two-stage Flexible Flow Shop Scheduling with Tail Group Constraint

作　　者：黎展滔[1] 陈庆新[1] 毛宁[1] 

机构地区：[1]广东工业大学广东省计算机集成制造系统重点实验室,广州510006

出　　处：《机械工程学报》2013年第12期183-192,共10页Journal of Mechanical Engineering

基　　金：国家自然科学基金(51175094);广东省部产学研结合(2010A090200054);广东省教育部产学研结合示范基地(2010B091101007)资助项目

摘　　要：提出一类考虑后成组约束的、工件批量到达的两阶段柔性流水车间调度问题,并且在每阶段都是由非同等并行机构成,在对后成组约束进行定义和数学描述的基础上,进一步建立两阶段柔性流水车间调度问题的优化模型。通过对该类调度问题的分析,得到一条调度优势准则(定理1),并且根据定理1,设计一种基于组合调度规则的启发式算法以及该类调度问题的算例生成方法。为验证算法和比较评估调度规则的性能,对算例采用基于文献所提出的12种组合调度规则和启发式算法进行仿真调度,对调度结果的分析表明,算法的有效性和启发式算法调度规则在求解所提出的两阶段柔性流水调度问题的优越性能。Two-stage flexible flow shop scheduling problem with task tail group constraint and releasing in batch is proposed, where the two stages are made up of unrelated machines. Based on defining two-stage flexible flow shop with tail group constraint and giving its mathematical description systematically, the optimization model of the two-stage flexible flow shop scheduling is put forward. Through analyzing of this kind of problem, a rule of advantage scheduling （theorem 1） is proved. According to theorem 1, a new heuristic method based on combinatorial dispatching rule, is designed. In order to validate the method and compare and evaluate the new heuristic, a simulation method is presented, and then twelve dispatching rules based on the literatures and heuristic are adopted in the scheduling simulation. Simulation results indicate that the heuristic method is effective and heuristic outperforms the other twelve dispatching rules with respect to the two-stage flexible flow shop scheduling problem proposed.

关 键 词：启发式算法 柔性流水车间 后成组约束 

分 类 号：F406[经济管理—产业经济]