Authors: Florian T. Hecker, Bernd Hitzmann
The production in bakeries can be modelled as a no- wait permutation flow-shop based on the constraints and frame conditions given by the real production processes. A modified genetic algorithm, ant colony optimization and particle swarm optimization were used to analyse and optimize the production planning of a bakery production line that processes 40 products on 26 production stages. This setup leads to 8.2 x 1047 different possible schedules in a permutation flow-shop model and is thus not solvable in reasonable time with exact methods. The makespan of the production, an objective function of high economic interest, was analysed. In combination with the created model, the applied algorithms proved capable to provide optimized results for the scheduling operation within a restricted computational time of 15 min, reducing the makespan by up to 8.6 %.