Abstract
Scheduling problem is one of popular combinatorial cases. One of the basic scheduling problem is Single Machine Total Weighted Tardiness Problem (SMTWTP). This problem falls in NP-hard problem which is not easy to solve using an exact method as the scale getting larger. Nowadays, the number of research which develop and apply metaheuristics methods in solving combinatorial problems are quite high. One of new metaheuristics method which adopt biogeography phenomenon is Biogeography-based Optimization (BBO). BBO algorithm is known to have a quite good performance to solve continuous problems. In this research, BBO is developed to solve a discrete problem such as SMTWTP. Based on experimental results, BBO is able to solve 57 out of 75 instances. BBO has a better performance compared to Particle Swarm Optimization (PSO) with solving 19 out of 75. But, compared to modified Genetic Algorithm which can solve 67 instances, BBO is not better.
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.
