Abstract
Production sequence of workpieces on machines, also called job-shop scheduling problem (JSP), is a focus both in academics and in practices. The research on the problem can promote theoretical progress, shorten the production cycles, improve efficiency in using resources, and strengthen market response in actual production. Ant colony optimization (ACO) is very suitable for the solving of the problem. In the paper, a disjunctive graph model of JSP is set up, which transforms the problem into a natural expression that is suitable for ACO. Then, realization steps of ACO for JSP are discussed. Finally, a 3×3 JSP problem is solved in Jbuilder X. The obtained optimal solution verifies the feasibility and effectiveness of ACO in solving JSP.
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.
