Abstract
Ant Colony Optimization (ACO) is a new algorithm approach, inspired by the foraging behavior of real ants. It has frequently been applied to many optimization problems and one such problem is in solving the job shop problem (JSP). The JSP is a finite set of jobs processed on a finite set of machine where once a job initiates processing on a given machine, it must complete processing and uninterrupted. In solving the Job Shop Scheduling problem, the process is measure by the amount of time required in completing a job known as a makespan and minimizing the makespan is the main objective of this study. In this paper, we developed an ACO algorithm to minimize the makespan. A real set of problems from a metal company in Johor bahru, producing 20 parts with jobs involving the process of clinching, tapping and power press respectively. The result from this study shows that the proposed ACO heuristics managed to produce a god result in a short time.
Highlights
Scheduling has been defined as "the art of assigning resources to tasks in order to ensure the completion of these tasks in a reasonable amount of time" [1]
Once a job initiates processing on a given machine it must complete processing and must be uninterrupted
In searching for the optimal or near optimal solution to the Job Shop Problem (JSP), we explore the possibility of using Ant Colony Optimization (ACO) approach
Summary
Scheduling has been defined as "the art of assigning resources to tasks in order to ensure the completion of these tasks in a reasonable amount of time" [1]. A job shop scheduling problem is a problem of as scheduling n given jobs varying sizes on m given identical machines, while trying to minimize the total length or time of the schedule (that is when all the assigned jobs have finished processing). Once a job initiates processing on a given machine it must complete processing and must be uninterrupted. It is common that nowadays, the job command are given online where upon completing a job, a system or an algorithm is required to make a decision about the job. The Job Shop Problem (JSP) is divided into three common shop models for scheduling namely Open Shops, Flow Shops, and Job Shops. Unlike JSP and FSP, the Open Shop model is a ‘build to order’ system where no inventory is required
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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.
