The article presents an integrated resolution of the joint production and maintenance scheduling problem in hybrid flowshop. Two resolution methods are used on the basis of a new coding to represent a joint production and maintenance scheduling: Taboo search where we proposed an algorithm for the generation of a joint initial solution and neighbourhood, and GA where we proposed new joint operators for crossover and mutation. Computational experiments are conducted on a large set of instances and the resulting genetic algorithm gives the best results so far. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Benbouzid-Sitayeb, F., Tirchi, M., & Mahloul, A. (2007). An integrated resolution of joint production and maintenance scheduling problem in hybrid flowshop. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4527 LNCS, pp. 518–527). Springer Verlag. https://doi.org/10.1007/978-3-540-73053-8_52
Mendeley helps you to discover research relevant for your work.