An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem

Combinatorial optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory that sit at the intersection of several fields, including artificial intelligence, mathematics and software enginee...

Full description

Saved in:

Bibliographic Details
Main Author:	Abdul Mahad @ Abdul Hamid, Diyana
Format:	Thesis
Language:	English
Published:	2011
Subjects:	QA Mathematics
Online Access:	http://eprints.utm.my/id/eprint/47961/25/DiyanaAbdMahadMFS2011.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.47961
record_format	uketd_dc
spelling	my-utm-ep.479612018-05-30T03:40:28Z An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem 2011-05 Abdul Mahad @ Abdul Hamid, Diyana QA Mathematics Combinatorial optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory that sit at the intersection of several fields, including artificial intelligence, mathematics and software engineering. The quest for a solution to NP-hard problem has brought many researchers into developing approximation method, an algorithm which attempts to find solutions to hard optimization problems but gives no guarantee that the solution is the best possible solution. In this research Ant Colony Optimization (ACO) heuristics algorithm is proposed to solve Job Shop Scheduling Problem (JSP). An appropriate ACO algorithm based on the job shop problem is developed and implemented on a case study of JSP with the aims of improving the performance of the algorithm in term of computational effort and time. It is about minimizing the total completion time, such as the makespan of a selected n-jobs and m-machines problem. Results from the case study have shown that the proposed ACO algorithm has a competitive advantage over the best given solution. 2011-05 Thesis http://eprints.utm.my/id/eprint/47961/ http://eprints.utm.my/id/eprint/47961/25/DiyanaAbdMahadMFS2011.pdf application/pdf en public masters Universiti Teknologi Malaysia, Faculty of Science Faculty of Science
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA Mathematics
spellingShingle	QA Mathematics Abdul Mahad @ Abdul Hamid, Diyana An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
description	Combinatorial optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory that sit at the intersection of several fields, including artificial intelligence, mathematics and software engineering. The quest for a solution to NP-hard problem has brought many researchers into developing approximation method, an algorithm which attempts to find solutions to hard optimization problems but gives no guarantee that the solution is the best possible solution. In this research Ant Colony Optimization (ACO) heuristics algorithm is proposed to solve Job Shop Scheduling Problem (JSP). An appropriate ACO algorithm based on the job shop problem is developed and implemented on a case study of JSP with the aims of improving the performance of the algorithm in term of computational effort and time. It is about minimizing the total completion time, such as the makespan of a selected n-jobs and m-machines problem. Results from the case study have shown that the proposed ACO algorithm has a competitive advantage over the best given solution.
format	Thesis
qualification_level	Master's degree
author	Abdul Mahad @ Abdul Hamid, Diyana
author_facet	Abdul Mahad @ Abdul Hamid, Diyana
author_sort	Abdul Mahad @ Abdul Hamid, Diyana
title	An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
title_short	An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
title_full	An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
title_fullStr	An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
title_full_unstemmed	An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
title_sort	ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
granting_institution	Universiti Teknologi Malaysia, Faculty of Science
granting_department	Faculty of Science
publishDate	2011
url	http://eprints.utm.my/id/eprint/47961/25/DiyanaAbdMahadMFS2011.pdf
_version_	1747817273833291776

An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem

Similar Items