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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
