A hybrid bacterial foraging optimization algorithm for makespan minimization in permutation flow shop scheduling
Permutation flow shop scheduling problems (PFSP) with makespan minimization are a standard benchmark in production scheduling, where solution quality depends on effective search in a discrete permutation space. This paper proposes HBFO, a hybrid discrete bacterial foraging optimization method that implements bacterial...