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 |
| Summary: | 碩士 === 大葉大學 === 工業工程研究所 === 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.
|
|---|