A novel scheduling framework: Integrating genetic algorithms and discrete event simulation

Most of the research works on methods and techniques for solving the job-shop scheduling problem (JSSP) propose theoretically powerful optimisation algorithms that indeed are practically difficult to apply in real industrial scenarios due to the complexity of these production systems. This paper aims at filling the gap between research and industrial worlds by creating a framework of general applicability for solving the JSSP. Through a literature analysis, the constituent elements of the framework have been identified: an optimisation method that can solve NP-hard JSSP problem in a reasonable time, i.e., the genetic algorithm (GA), and a tool that allows precisely modelling the production system and evaluating the goodness of the schedules, i.e., a simulation model. A case study of a company that bases its business in the manufacturing of aerospace components proved the applicability of the proposed framework.