Assigning dispatching rules using a genetic algorithm to solve a hybrid flow shop scheduling problem
Benjamin Rolf, Tobias Reggelin, Abdulrahman Nahhas, Sebastian Lang, Marcel Müller
Abstract
The paper shows how assigning different predefined dispatching rules for a predefined number of times at any points in time using a genetic algorithm can solve a hybrid flow shop scheduling problem with sequence-dependent setup times, using the example of a company producing printed circuit boards. The paper describes the implementation of the genetic algorithm, analyses the results for four different data sets and compares them with the results of applying standard dispatching rules. Using a genetic algorithm to assign dispatching rules achieves better solutions than simple dispatching rules often used in industrial practice. The genetic algorithm already achieves good solutions after a few seconds up to a few minutes, which means that this approach can be used for real-time decision making in a cyber-physical system in the age of Industry 4.0.