Abstract
Flexible job-shop scheduling problem derived from the job-shop scheduling problem, and is more realistic than the job-shop scheduling problem in the manufacturing enterprise. It should be utilized with high efficiency. But it is a multi-objective optimal problem. Three minimization objectives (Maximum completion time (makespan), Total workload of machines and Workload of the critical machine) are considered simultaneously. This multi-objective flexible job-shop scheduling problem is one of the hardest combinatorial optimization problems, and is a strongly NP-hard problem. To solve the multi-objective flexible job-shop scheduling problem, a quantum immune algorithm based on the quantum and immune principles is proposed. According to the analysis of the experimental results, this algorithm is feasible and effective to solve the multi-objective flexible job-shop scheduling problem. It effectively relieves some disadvantages of the quantum and immune optimization
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.
