Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery

Based on the constraints and frame conditions given by the real processes the production in bakeries can be modelled as a no-wait permutation flow-shop, following the definitions in scheduling theory. A modified genetic algorithm, ant colony optimization and a random search procedure 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 × 1047 different possible schedules in a permutation flow-shop model and is thus not solvable in reasonable time with exact methods. Two objective functions of economical interest were analysed, the makespan and the total idle time of machines. In combination with the created model, the applied algorithms proved capable to provide optimized results for the scheduling operation within a predefined runtime of 15 min, reducing the makespan by up to 8.6% and the total idle time of machines by up to 23%.