Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kaabi, J.: Contribution à l’ordonnancement des activités de maintenance dans les systèmes de production. Thèse de doctorat soutenue à l’Université de Franche Comté, France (2004)
Garey, M.R., Johnson, D.S., Sethi, R.: the complexity of flowshop and jobshop scheduling. Mathematics of Operations Researchs 1, 117–129 (1976)
Graham, R.L.: Bounds for multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17, 416–429 (1969)
Gupta, J.N.D., Tunc, E.A.: Schedules for a two-stages hybrid flowshop with parallel machines at the second stage. International Journal of production Research 29, 1489–1502 (1991)
Barlow, R., Hunter, L.: Optimal preventive maintenance policies. Operations Research 8, 90–100 (1960)
Goldberg, D.E.: Genetic algorithms in search, Optimisation and Machine Learning. Addison-Wesley, Reading (1989)
Glover, F.: Taboo search: Part I. ORSA Journal of Computing 1, 190–206 (1989)
Benbouzid, F., Bessadi, Y., Guebli, S., Varnier, C., Zerhouni, N.: Résolution du problème de l’ordonnancement conjoint maintenance/production par la stratégie séquentielle. In: MOSIM’03, Toulouse, France, vol. 2, pp. 627–634 (2003)
Ruiz, R., Maroto, C.: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machines eligibility. EJORS (June 2004)
Néron, E.: Du flowshop hybride au problème cumulatif. Thèse de doctorat soutenue à l’Université de Technologie de Compiègne, France (1999)
Vignier, A.: contribution à la résolution des problèmes d’ordonnancement de type monogamme, multimachines (flowshop hybride). Thèse de doctorat soutenue à l’université de Tours, France (1997)
Taillard, E.: Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem. European Journal of Operational Research 47, 65–74 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Benbouzid-Sitayeb, F., Tirchi, M., Mahloul, A. (2007). An Integrated Resolution of Joint Production and Maintenance Scheduling Problem in Hybrid Flowshop. In: Mira, J., Álvarez, J.R. (eds) Bio-inspired Modeling of Cognitive Tasks. IWINAC 2007. Lecture Notes in Computer Science, vol 4527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73053-8_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-73053-8_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73052-1
Online ISBN: 978-3-540-73053-8
eBook Packages: Computer ScienceComputer Science (R0)