Universiti Teknologi Malaysia Institutional Repository

Ant foraging behavior for job shop problem

Mahad, D. A. and Ismail, Z. (2016) Ant foraging behavior for job shop problem. In: 2016 International Conference on Design Engineering and Science, ICDES 2016, 27 February 2016 through 29 February 2016, Selangor Darul Ehsan, Malaysia.

Full text not available from this repository.

Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

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.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:Algorithms, Ant colony optimization, Artificial intelligence, Metal stamping, Optimization Presses (machine tools), Problem solving, Set theory
Subjects:Q Science > QA Mathematics
Divisions:Science
ID Code:73288
Deposited By: Muhammad Atiff Mahussain
Deposited On:22 Nov 2017 12:07
Last Modified:22 Nov 2017 12:07

Repository Staff Only: item control page