Abstract
Solving Flexible Job Shop Problem (FJSSP) under machine breakdown with robustness and stability is an important field of manufacturing. Due to the shortage of the existing measure of stability based on the end time of each operation, a new stable measure based on machine allocation for each operation is proposed. Considering this is a multi-object problem and their optimization can be seen as game procedure, a game model is build and the Nash Equilibrium (NE) solutions of the problem are tried to find. To obtain the better NE solution, an improving clone immune algorithm is also proposed. In this algorithm, Pareto-optimization mechanism is introduced to shrink the searching scope of NE solutions and the better solutions are obtained. Experiments show the effectiveness of the new approach.
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.
