Abstract
In this paper, hybrid flowshop (HFS) scheduling problems with sequence dependent setup times (SDST) are considered. The objective is to minimise the total tardiness. As these problems were proved to be strongly NP-hard (non-deterministic polynomial time hard) type combinatorial optimisation problems, exact methods cannot be used to solve the problems. Hence, many heuristics and meta-heuristics were addressed in the literature to solve the problems. In this paper, discrete version of a recently developed bio-inspired meta-heuristic algorithm called as discrete firefly algorithm (DFA) is proposed to solve the problems. Extensive computational experiments are carried out to validate the performance of the proposed algorithm. Computational results reveal the success of the proposed algorithm.
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.
