| The general m -machine flow-shop problem is a common scheduling problem, which is known to be NP-hard for m > 2 and has no exact combinatorial algorithms. Because of the difficulty of finding optimal solutions to large-size problems, there is considerable interest in developing efficient heuristics. In this paper, we first develop an ant-colony algorithm to solve the make-span or total completion time flow-shop problem. And by some computational experiments, we compare our algorithm with some efficient algorithms to get some conclusions. In the article, we also present the description modeling and some other efficient algorithms of the flow-shop scheduling problem in detail as well as the procedure with C language.
|
PDF Full Text Request