Abstract
The job-shop scheduling problem (JSP) is currently a problem that affects processing efficiency and economic benefits in large-scale processing workshops. JSP aims at the optimal completion time, which is a difficult process arrangement and machine allocation problem. Artificial bee colony (ABC) algorithm is a common algorithm to solve JSP. Firstly, this article introduces the problem of job-shop scheduling, secondly analyzes the principle of the ABC algorithm, and finally verifies the effectiveness of the ABC algorithm in solving JSP through experiments.
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.
