To search, Click below search items.


All Published Papers Search Service


Greedy Algorithm Solution of Flexible Flow Shop Scheduling Problem


Xiaofeng Li, Hai Zhao


Vol. 9  No. 11  pp. 177-180


Flexible flow shop scheduling problem (also called blended flow shop scheduling problem) is a sort of complex Job Shop Scheduling problem. For the Flexible Flow Shop scheduling problem, only in very special cases, there are polynomial optimal algorithms. In most of the other cases, the problems are NP-Hard. It is a simplification of the original problem to solve Flexible flow shop scheduling with Greedy algorithm, and it is also a combination of efficiency and algorithm. In this paper, a greedy algorithm solving flexible flow shop scheduling problem is given, and the capability of the algorithm is evaluated.


Flexible Flow Shop, Job Shop Scheduling, Greedy Algorithm