Tabu search method for solving multiobjective job shop scheduling problem

Scheduling is widely studied and it involves of complex combinatorial optimization problems. A job shop scheduling problem (JSSP) is one of the common scheduling problems. The application of it ranges from manufacturing to services industries. It can be considered as a NP-hard problem. A lot of rese...

Full description

Saved in:

Bibliographic Details
Main Author:	Awang, Nor Fauzana
Format:	Thesis
Language:	English
Published:	2015
Subjects:	QA Mathematics
Online Access:	http://eprints.utm.my/id/eprint/53981/25/NorFauzanaAwangMFS2015.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.53981
record_format	uketd_dc
spelling	my-utm-ep.539812020-10-11T09:00:55Z Tabu search method for solving multiobjective job shop scheduling problem 2015-01 Awang, Nor Fauzana QA Mathematics Scheduling is widely studied and it involves of complex combinatorial optimization problems. A job shop scheduling problem (JSSP) is one of the common scheduling problems. The application of it ranges from manufacturing to services industries. It can be considered as a NP-hard problem. A lot of research has been performed in this particular area to obtain an effective schedule jobs for various objectives. More than one objective in a single problem is considered multiobjective problem. Two objectives, which are the maximum completion time (makespan) and total weighted tardiness, are measured simultaneously to improve the performance of the schedule. In this study, metaheuristic method known as tabu search algorithm is proposed to tackle the problem. But, first of all Giffler and Thompson (GT) algorithm will be applied to obtain the potential initial solution for the respective problem. Benchmark problem is used to evaluate and study the performance of the proposed algorithm. Results shows that tabu search provide a better solution compared to simulated annealing method. 2015-01 Thesis http://eprints.utm.my/id/eprint/53981/ http://eprints.utm.my/id/eprint/53981/25/NorFauzanaAwangMFS2015.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:85830 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 Awang, Nor Fauzana Tabu search method for solving multiobjective job shop scheduling problem
description	Scheduling is widely studied and it involves of complex combinatorial optimization problems. A job shop scheduling problem (JSSP) is one of the common scheduling problems. The application of it ranges from manufacturing to services industries. It can be considered as a NP-hard problem. A lot of research has been performed in this particular area to obtain an effective schedule jobs for various objectives. More than one objective in a single problem is considered multiobjective problem. Two objectives, which are the maximum completion time (makespan) and total weighted tardiness, are measured simultaneously to improve the performance of the schedule. In this study, metaheuristic method known as tabu search algorithm is proposed to tackle the problem. But, first of all Giffler and Thompson (GT) algorithm will be applied to obtain the potential initial solution for the respective problem. Benchmark problem is used to evaluate and study the performance of the proposed algorithm. Results shows that tabu search provide a better solution compared to simulated annealing method.
format	Thesis
qualification_level	Master's degree
author	Awang, Nor Fauzana
author_facet	Awang, Nor Fauzana
author_sort	Awang, Nor Fauzana
title	Tabu search method for solving multiobjective job shop scheduling problem
title_short	Tabu search method for solving multiobjective job shop scheduling problem
title_full	Tabu search method for solving multiobjective job shop scheduling problem
title_fullStr	Tabu search method for solving multiobjective job shop scheduling problem
title_full_unstemmed	Tabu search method for solving multiobjective job shop scheduling problem
title_sort	tabu search method for solving multiobjective job shop scheduling problem
granting_institution	Universiti Teknologi Malaysia, Faculty of Science
granting_department	Faculty of Science
publishDate	2015
url	http://eprints.utm.my/id/eprint/53981/25/NorFauzanaAwangMFS2015.pdf
_version_	1747817666718990336

Tabu search method for solving multiobjective job shop scheduling problem

Similar Items