Abstract
This paper studies multi-objective flow shop scheduling problems with interfering jobs. That is, there are two sets of jobs and each of which has its own objective. Some jobs are scheduled so as to minimize makespan while the others are to minimize total tardiness. In this case, the problem was mathematically modeled by a mixed integer linear program. Then, a novel biogeography-based optimization was developed to solve the problem. To evaluate the algorithm, its performance was compared with three well-known algorithms in the literature. The results of the present study show that the proposed algorithm outperforms the other tested algorithms.
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.
