Application of Node Based Coincidence algorithm for flow shop scheduling problems

Abstract

This work proposes an algorithm called Node Based Coincidence algorithm (NB-COIN) focusing on total flowtime minimization in the permutation flowshop scheduling problems. Many algorithms have been proved to be effective for this problem. However, in the real situation, cost of computation becomes an important factor. NB-COIN produces reasonable solutions using a lot less computation power than other algorithms in consideration. Compared to a number of wellknown algorithms, the results show that NB-COIN is an effective algorithm which generates less than 1.7% different from recently best known solutions from Taillard's benchmark instances.