Abstract
This paper deals with the scheduling problem of minimizing the makespan in a permutational flowshop environment with the possibility of outsourcing certain jobs. It addresses this problem by means of the development of an ant colony optimization-based algorithm. This new algorithm, here named as flowshop ant colony optimization is composed of two combined ACO heuristics. The results show that this new approach can be used to solve the problem efficiently and in a short computational time.
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.
