欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
以模具加工车间为背景，分析具有前成组约束的两阶段柔性流水车间的特点，在对前成组约束进行定义和数学描述的基础上，以最少化最大完工时间为目标，建立具有前成组约束的、工件批量到达的两阶段柔性流水车间调度问题的数学模型，并且在第一阶段由两个成组加工单元构成；接着针对这一模型，提出一种启发式求解算法H’；运用数学分析的手段，给出该算法优化结果的一个下界；设计大量的实例测试集，将启发式算法H’与其他三种改造后的经典启发式算法进行性能比较，不仅验证启发式算法H’的有效性，而且还发现随着任务规模的增大，启发式算法H，的优越性更加明显，这一结论对H，算法在模具加工车间调度上的应用具有重要意义。
英文摘要：
Based on a background to the shops in the mould manufacturers, It considers a two-stage flexible flow shop scheduling problem subject to release dates, where the first stage is made up of unrelated machines and tasks have group constraint. Based on defining two-stage flexible flow shop with head group constraint and giving its mathematical description systematically, a mathematic model is formulated where the objective is to find a schedule that minimizes makespan. Because this problem is NP-hard, a constructive heuristic algorithm H＇ is proposed and its lower bound（LB） is proved. In addition, some classical heuristics are developed. In order to test the efficiency of the algorithm, sets of examples are designed. Compared to the classical developed heuristics, the performance of algorithm H＇ is more superior than other three heuristics, and algorithm H＇ solves large sized problems in a reasonable solution time, which is significant to the application in the shops of mould makers.
同期刊论文项目
同项目期刊论文
期刊信息
位置：