Kind of genetic algorithm for solving flow shop sequencing problems

Hong Zhou; Maofeng Cai; Yuncheng Feng

Kind of genetic algorithm for solving flow shop sequencing problems

Hong Zhou^*
, Maofeng Cai
, Yuncheng Feng

^*此作品的通讯作者

Peking University

科研成果: 期刊稿件 › 文章 › 同行评审

1 引用（Scopus）

摘要

Studies on scheduling and sequencing in job shops are important branches in the fields of both production management and combinatorial optimization. A kind of genetic algorithm implementation is made to solve the flow shop sequencing problems with the form of n/m/P/C_max and the genetic operators are improved. The algorithm proves to be effective and efficient both in computation and convergence by analyzing the results of some experiments on it.

源语言	英语
页（从-至）	440-445
页数	6
期刊	Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics
卷	23
期	4
出版状态	已出版 - 1997
已对外发布	是

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{5a603576ac024aef9cfc5b5e79664fe5,

title = "Kind of genetic algorithm for solving flow shop sequencing problems",

abstract = "Studies on scheduling and sequencing in job shops are important branches in the fields of both production management and combinatorial optimization. A kind of genetic algorithm implementation is made to solve the flow shop sequencing problems with the form of n/m/P/Cmax and the genetic operators are improved. The algorithm proves to be effective and efficient both in computation and convergence by analyzing the results of some experiments on it.",

author = "Hong Zhou and Maofeng Cai and Yuncheng Feng",

year = "1997",

language = "英语",

volume = "23",

pages = "440--445",

journal = "Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics",

issn = "1001-5965",

publisher = "Beijing University of Aeronautics and Astronautics (BUAA)",

number = "4",

}

TY - JOUR

T1 - Kind of genetic algorithm for solving flow shop sequencing problems

AU - Zhou, Hong

AU - Cai, Maofeng

AU - Feng, Yuncheng

PY - 1997

Y1 - 1997

N2 - Studies on scheduling and sequencing in job shops are important branches in the fields of both production management and combinatorial optimization. A kind of genetic algorithm implementation is made to solve the flow shop sequencing problems with the form of n/m/P/Cmax and the genetic operators are improved. The algorithm proves to be effective and efficient both in computation and convergence by analyzing the results of some experiments on it.

AB - Studies on scheduling and sequencing in job shops are important branches in the fields of both production management and combinatorial optimization. A kind of genetic algorithm implementation is made to solve the flow shop sequencing problems with the form of n/m/P/Cmax and the genetic operators are improved. The algorithm proves to be effective and efficient both in computation and convergence by analyzing the results of some experiments on it.

UR - https://www.scopus.com/pages/publications/0031294576

M3 - 文章

AN - SCOPUS:0031294576

SN - 1001-5965

VL - 23

SP - 440

EP - 445

JO - Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics

JF - Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics

IS - 4

ER -

Kind of genetic algorithm for solving flow shop sequencing problems

摘要

其它文件与链接

指纹

引用此