The Application of Tabu Search in FMS Scheduling
碩士 === 大葉大學 === 工業工程研究所 === 86 === In this research, Tabu Search heuristic algorithm is presented to deal with the Flexible Manufacturing System (FMS) sceduling problems with the due date constraints in anticipation to minimum the mean tardiness of thesystem. The approach is studied in three phases...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
1998
|
Online Access: | http://ndltd.ncl.edu.tw/handle/23977767549291429454 |
id |
ndltd-TW-086DYU00030013 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-086DYU000300132016-01-22T04:17:09Z http://ndltd.ncl.edu.tw/handle/23977767549291429454 The Application of Tabu Search in FMS Scheduling 禁忌搜尋法在彈性製造系統排程問題之應用 Wu- Chia Chang 吳佳璋 碩士 大葉大學 工業工程研究所 86 In this research, Tabu Search heuristic algorithm is presented to deal with the Flexible Manufacturing System (FMS) sceduling problems with the due date constraints in anticipation to minimum the mean tardiness of thesystem. The approach is studied in three phases. First, for the mean tardinesscriterion, a job-oriented heuristic (JOH) is constructed to solve the addressed FMS scheduling problem. Then an experiment is designed to checkthe best combination of tabu list size and ending iteration number. Finally,the Tabu Search with long-term memory construction is developed to improvethe performance quality. The performance of the designed algorithm willcompared with the Tabu Search heuristic using short-term memory construction. Through the statistical analysis to show the superior of the constructedheuristic. Chinyao Low 駱景堯- 1998 學位論文 ; thesis 0 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 大葉大學 === 工業工程研究所 === 86 === In this research, Tabu Search heuristic algorithm is presented to deal with the Flexible Manufacturing System (FMS) sceduling problems with the due date constraints in anticipation to minimum the mean tardiness of thesystem. The approach is studied in three phases. First, for the mean tardinesscriterion, a job-oriented heuristic (JOH) is constructed to solve the addressed FMS scheduling problem. Then an experiment is designed to checkthe best combination of tabu list size and ending iteration number. Finally,the Tabu Search with long-term memory construction is developed to improvethe performance quality. The performance of the designed algorithm willcompared with the Tabu Search heuristic using short-term memory construction. Through the statistical analysis to show the superior of the constructedheuristic.
|
author2 |
Chinyao Low |
author_facet |
Chinyao Low Wu- Chia Chang 吳佳璋 |
author |
Wu- Chia Chang 吳佳璋 |
spellingShingle |
Wu- Chia Chang 吳佳璋 The Application of Tabu Search in FMS Scheduling |
author_sort |
Wu- Chia Chang |
title |
The Application of Tabu Search in FMS Scheduling |
title_short |
The Application of Tabu Search in FMS Scheduling |
title_full |
The Application of Tabu Search in FMS Scheduling |
title_fullStr |
The Application of Tabu Search in FMS Scheduling |
title_full_unstemmed |
The Application of Tabu Search in FMS Scheduling |
title_sort |
application of tabu search in fms scheduling |
publishDate |
1998 |
url |
http://ndltd.ncl.edu.tw/handle/23977767549291429454 |
work_keys_str_mv |
AT wuchiachang theapplicationoftabusearchinfmsscheduling AT wújiāzhāng theapplicationoftabusearchinfmsscheduling AT wuchiachang jìnjìsōuxúnfǎzàidànxìngzhìzàoxìtǒngpáichéngwèntízhīyīngyòng AT wújiāzhāng jìnjìsōuxúnfǎzàidànxìngzhìzàoxìtǒngpáichéngwèntízhīyīngyòng AT wuchiachang applicationoftabusearchinfmsscheduling AT wújiāzhāng applicationoftabusearchinfmsscheduling |
_version_ |
1718161998309490688 |