Abstract
Fuzziness and flexibility are the features of most production processes; however, the scheduling problems with both flexible process plans and fuzzy processing conditions are not investigated fully for high complexity. This paper proposes an efficient swarm-based neighbourhood search algorithm (SNSA) for the fuzzy flexible job shop scheduling problem. In SNSA, ordered operation-based representation is used to indicate the solution of operation sequence sub-problem and machine assignment sub-problem is converted into a cell formation one, in which machines are regarded as cells and operations are allocated into cells. In each generation, two swaps, an insertion and tournament selection are applied to update swarms. Some numerical experiments are conducted by using some instances to show the effectiveness of SNSA. Computational results show that SNSA performs better than the existing methods from literature.
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.
