 A novel scheduling framework: integrating genetic algorithms and discrete event simulationLuca Fumagalli, Elisa Negri, Edoardo Sottoriva, Adalberto Polenghi and Marco Macchi International Journal of Management and Decision Making, 2018, vol. 17, issue 4, 371-395 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. Keywords: scheduling framework; job-shop; job-shop scheduling problem; JSSP; genetic algorithm; discrete event simulation; DES. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmdma:v:17:y:2018:i:4:p:371-395 Access Statistics for this article More articles in International Journal of Management and Decision Making from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.