• 论文 •    

基于遗传优化算法求解作业车间调度问题

姜思杰,徐晓飞,李全龙   

  1. 哈尔滨工业大学计算机科学与工程系,黑龙江哈尔滨150001
  • 出版日期:2002-03-15 发布日期:2002-03-25

An Optimal Algorithm for a Class of Jobshop Scheduling Problems

JIANG Si-jie, XU Xiao-fei, LI Quan-long   

  1. Dept. of Computer Science and Engineering,Harbin Institute of Technology, Harbin150001,China
  • Online:2002-03-15 Published:2002-03-25

摘要: 将一类具有路径柔性的作业车间调度问题,分解为任务优化分配和任务优化调度两个子问题,结合遗传算法和启发式算法,提出了基于遗传的优化调度算法,并用实例证实了该算法的有效性。

关键词: 作业车间, 路径柔性, 启发式算法

Abstract: The scheduling problem on a class of jobshop with routing flexibility is divided into two subproblems, which are the task's optimal distribution and optimal scheduling. A genetics based optimal scheduling algorithm, which combines the genetic algorithm and heuristic algorithm, is presented, and is proven to be effective by an example.

Key words: jobshop, routing flexibility, heuristic algorithm, genetic algorithm

中图分类号: