| 注册
首页|期刊导航|河南科技大学学报(自然科学版)|转移批量自适应的作业排程优化方法

转移批量自适应的作业排程优化方法

郑波克 杨晓英

河南科技大学学报(自然科学版)2012,Vol.33Issue(2):17-21,5.
河南科技大学学报(自然科学版)2012,Vol.33Issue(2):17-21,5.

转移批量自适应的作业排程优化方法

郑波克 1杨晓英1

作者信息

  • 1. 河南科技大学机电工程学院,河南洛阳471003
  • 折叠

摘要

Abstract

In order to shorten delivery period of products and improve the ability of responding quickly to market, genetic algorithm was applied to build an optimization method that can solve combinatorial optimization problem of scheduling with mixed transfer batch. Two different and efficient group operators including selection, crossover and mutation were designed to optimize both transfer batch and scheduling. Some mechanisms such as extending the life of outstanding individuals were used to improve the stability of genetic operation. These mechanisms can make the calculation convergence to the optimal solution or second-best solution in a short time. An example shows that the algorithm solving the scheduling problem of multiple transfer batches is effective and useful to discrete manufacturing companies.

关键词

遗传算法/离散制造/作业排程/转移批量/优化方法

Key words

Genetic algorithm/ Discrete manufacturing/ Operations scheduling/ Transfer batch/ Optimization methods

分类

数理科学

引用本文复制引用

郑波克,杨晓英..转移批量自适应的作业排程优化方法[J].河南科技大学学报(自然科学版),2012,33(2):17-21,5.

基金项目

河南省科技攻关计划项目(102102210487) (102102210487)

河南省教育厅自然科学研究计划项目(2011A410002) (2011A410002)

河南科技大学学报(自然科学版)

OA北大核心CSTPCD

1672-6871

访问量0
|
下载量0
段落导航相关论文