| dc.contributor | 資管系 | |
| dc.creator (作者) | 陳春龍 | zh_TW |
| dc.creator (作者) | Gupta, Jatinder N. D.;Palanimuthu, Nagarajan;Chen, Chuen-Lung | |
| dc.date (日期) | 1999 | |
| dc.date.accessioned | 12-Feb-2015 14:45:02 (UTC+8) | - |
| dc.date.available | 12-Feb-2015 14:45:02 (UTC+8) | - |
| dc.date.issued (上傳時間) | 12-Feb-2015 14:45:02 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/73508 | - |
| dc.description.abstract (摘要) | This paper discusses the process of desigining a tabu search-based heuristic for the two-stage flow shop problem with makespan minimization as the primary criterion and the minimization of total flow time as the secondary criterion. A factorial experiment is designed to analyse thoroughly the effects of four different factors, i.e. the initial solution, type of move, size of neighbourhood and the list size, on the performance of the tabu search-based heuristic. Using the techniques of evolution curves, and response tables and response graphs, coupled with the Taguchi method, the best combination of the factors for the tabu search-based heuristic is identified, and the effectiveness of the heuristic algorithm in finding an optimal solution is evaluated by comparing its performance with the best known heuristic to solve this problem. | |
| dc.format.extent | 208 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Production Planning and Control,10(3),251-265 | |
| dc.title (題名) | Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion | |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1080/095372899233217 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1080/095372899233217 | en_US |
