A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A multi-objective ant colony system algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
Computers and Operations Research
A new ant colony algorithm for makespan minimization in permutation flow shops
Computers and Industrial Engineering
| Hi-index | 12.05 |
The production of bakery goods is strictly time sensitive due to the complex biochemical processes during dough fermentation, which leads to special requirements for production planning and scheduling. Instead of mathematical methods scheduling is often completely based on the practical experience of the responsible employees in bakeries. This sometimes inconsiderate scheduling approach often leads to sub-optimal performance of companies. This paper presents the modeling of the production in bakeries as a kind of no-wait hybrid flow-shop following the definitions in Scheduling Theory, concerning the constraints and frame conditions given by the employed processes properties. Particle Swarm Optimization and Ant Colony Optimization, two widely used evolutionary algorithms for solving scheduling problems, were adapted and used to analyse and optimize the production planning of an example bakery. In combination with the created model both algorithms proved capable to provide optimized results for the scheduling operation within a predefined runtime of 15min.