Application of genetic algorithm to the technological operations scheduling problem

Abstract

The basic enterprise task is to satisfy customer requirements: due date, price and quality. Based on experiences from engineers practice of work in Croatian enterprises it could be concluded that enterprises are not able to fulfil obligations to the customer in a way of due dates. One of the basic reasons lies in inappropriate scheduling model that has not had possibility to make plan variants. The paper shows how genetic algorithm could be successfully applied in scheduling model to solve the problem of plan variant. As a basic selection in the paper 3-tournament steady-state selection has been applied.

Keywords

• artificial intelligence
• genetic algorithms
• manufacturing
• scheduling