《2016 Modular design of a hybrid genetic algorithm for a flexible job–shop scheduling problem》.pdf

Knowledge-Based Systems 24 (2011) 102–112 Contents lists available at ScienceDirect Knowledge-Based Systems journal homepage: www.else /locate/knosys Modular design of a hybrid genetic algorithm for a flexible job–shop scheduling problem Celia Gutiérrez a,*, Iván García-Magariño b a Department of Software Engineering and Artificial Intelligence, Universidad Complutense de Madrid, cnProf. Jose Garcia, Santesmases s/n, 28040 Madrid, Spain b Department of Sciences and Engineering, Universidad a Distancia de Madrid, Spain a r t i c l e i n f o a b s t r a c t Article history: The aim of the job–shop scheduling problem is to optimize the task planning in an industrial plant Received 4 March 2010 satisfying time and technological constraints. The existing algorithmic and mathematical methods for Received in revised form 16 July 2010 solving this problem usually have high computational complexities making them intractable. Flexible Accepted 19 July 2010 job–shop scheduling becomes even more complex, since it allows one to assign each operation to a Available online 23 July 2010 resource from a set of suitable ones. Alternative heuristic methods are only able to satisfy part of the con- straints applicable to the problem. Moreover, these solutions usually offer little flexibility to adapt them Keywords: to new requirements. This paper describes research within heuristic methods that combines