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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
