J4 ›› 2009, Vol. 27 ›› Issue (06): 585-.

• 论文 • 上一篇    下一篇

柔性流水作业排序问题的贪心算法求解

李晓峰1|赵 海1|杜洪军2|刘小勇3
  

  1. 1东北大学 信息科学与工程学院, 沈阳 110004;2中国移动通信集团吉林有限公司 业务支撑中心|长春 130021;
    3北京邮电大学 人文学院|北京 100876
  • 出版日期:2009-11-20 发布日期:2009-12-18
  • 通讯作者: 李晓峰(1962— ),男,沈阳人,东北大学博士研究生,主要从事金融计算机安全研究 E-mail:xfli@chinaums.com
  • 作者简介:李晓峰(1962— )|男|沈阳人|东北大学博士研究生|主要从事金融计算机安全研究|(Tel)86-13818086663(E-mail)xfli@chinaums.com;赵海(1959— )|男|沈阳人|东北大学教授|博士生导师|主要从事计算机网络通信研究|(Tel)86-13904045486(E-mail)zhaoh@mail.neu.edu.cn。
  • 基金资助:

    国家863计划基金资助项目(2002AA145050);教育部高等学校科技创新工程基金资助项目(708026)

Greedy Algorithm Solution of Flexible Flow Shop Scheduling Problem

LI Xiao-feng1, ZHAO Hai1, DU Hong-jun2,LIU Xiao-yong3   

  1. 1College of Information Science and Engineering, Northeast University, Shenyang 110004,China;2Business Supporting Center,China Mobile Group Jilin |Company Limited| Changchun 130021,China;3School of Humanities,Law and Economics,Beijing University of Posts and Telecommunications,Beijing 100876,China
  • Online:2009-11-20 Published:2009-12-18

摘要:

柔性流水作业排序问题是一类复杂的车间作业调度问题。针对通常情况下调度问题求解困难的问题,给出了求解柔性流水作业排序问题近似解的贪心算法,并对其性能进行了分析测试。结果表明,虽然该贪心算法求出的近似解与最优解相比有一定误差,但由于其时间复杂度较小,因此对求解车间作业调度问题仍有一定的现实意义。

关键词: 柔性流水作业, 车间作业调度, 贪心算法

Abstract:

Flexible flow shop scheduling problem is a complex job shop scheduling problem. And the problem has polynomial difficulty. Most of the other cases the problem has NP difficulty. In order to solve the problem, a greedy algorithm to solve flexible flow shop scheduling is given, and the capability of the algorithm is evaluated. Even the approximate result solved by the greedy algorithm has a certain error with the optimal result; however, it has small time complexity, so it still makes sense to the job shop scheduling problem solving.

Key words: flexible flow shop, job shop scheduling, dreedy algorithm

中图分类号: 

  • TP391