Abstract
Flexible job-shop problem (FJSP) is an extension of the job shop problem that allows an operation to be processed by any machine from a given set along different routes. This paper presents a novel hybrid election campaign optimisation (ECO) algorithm combining with tabu search (TS) algorithm for solving the multi-objective FJSP to minimise the makespan, the total workload of all machines, and the workload of the busiest machine. ECO, as a new meta-heuristic, which integrates local search and global search scheme possesses high global search efficiency, TS, as a traditional meta-heuristic which possesses high local search ability. Through reasonably hybridising these two optimisation algorithms, an effective hybrid approach (ECO+TS), which makes full advantages of ECO and TS has been proposed for the multi-objective FJSP. The computational results have proved that the proposed hybrid algorithm is an efficient and effective approach to solve the multi-objective FJSP.
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 callMore From: International Journal of Materials and Structural Integrity
Disclaimer: 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.
