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

Previous Articles     Next Articles

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

CLC Number: 

  • TP391