A novel scheduling framework: integrating genetic algorithms and discrete event simulation Online publication date: Wed, 10-Oct-2018
by Luca Fumagalli; Elisa Negri; Edoardo Sottoriva; Adalberto Polenghi; Marco Macchi
International Journal of Management and Decision Making (IJMDM), Vol. 17, No. 4, 2018
Abstract: 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.
Online publication date: Wed, 10-Oct-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Management and Decision Making (IJMDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com