东北大学学报(自然科学版) ›› 2003, Vol. 24 ›› Issue (4): 338-341.DOI: -

• 论著 • 上一篇    下一篇

并行流程式生产线调度问题的概率分析求解算法

庞哈利;万珊珊   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳110004
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2003-04-15 发布日期:2013-06-23
  • 通讯作者: Pang, H.-L.
  • 作者简介:-
  • 基金资助:
    辽宁省博士启动基金资助项目 (2 0 0 112 0 2 0 )

Applying probability learning based evolutionary algorithm to parallel flow lines scheduling problem

Pang, Ha-Li (1); Wan, Shan-Shan (1)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2003-04-15 Published:2013-06-23
  • Contact: Pang, H.-L.
  • About author:-
  • Supported by:
    -

摘要: 并行生产线调度问题兼有并行机器和流程车间调度问题的特点 ,是一类新型的调度问题·针对工件在各工序具有任意加工时间的一般并行生产线调度问题 ,构造了整数规划模型 ,设计了基于概率分析的求解算法·对随机生成的测试问题进行求解的实验结果表明了算法的有效性

关键词: 并行生产线调度, 最大完工时间, 概率分析算法

Abstract: Parallel flow-lines scheduling is a new kind of scheduling. The parallel scheduling has the characters of the parallel machines and the flow shop scheduling. A general parallel flow lines problem with the objective of minimizing makespan was considered, and a mixed integer programming model is given. In view of the intractable nature of the problem, a probability learning based evolutionary algorithm was proposed to solve the problem. The algorithm was tested on some randomly generated problems.

中图分类号: