A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

Fardin Ahmadizar, Farnaz Barzinpour. A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem. Int. J. Computational Intelligence Systems, 3(6):853-861, 2010. [doi]

Abstract

Abstract is missing.