Abstract
This paper describes an application of artificial bee colony (ABC) algorithm, which is a new swarm intelligence approach, for a version of the single machine early/tardy scheduling problem where no unforced machine idle time is allowed. A local search is used inside the ABC algorithm to further improve the schedules obtained through it. A variant of the basic ABC approach is also considered in this paper where the best solution obtained through ABC algorithm is improved further via an exhaustive local search. We have compared these two approaches with 16 heuristic approaches reported in the literature on existing set of benchmark instances as well as on some large instances. Computational results show the effectiveness of our approaches.
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.
