A tabu search algorithm for a flexible flow line with unrelated parallel machines and with a bottleneck stage

Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/76748

Title:	A tabu search algorithm for a flexible flow line with unrelated parallel machines and with a bottleneck stage
Authors:	Chen, Chun-Lung;Chen, Chuen-Lung 陳春龍
Contributors:	資管系
Keywords:	Bottleneck;Computational experiment;Effectiveness and efficiencies;Flexible flow line;Makespan;Tabu search algorithms;Traditional Tabu searches;Unrelated parallel machines;Industrial engineering;Learning algorithms;Scheduling algorithms;Simulated annealing;Tabu search;Problem solving
Date:	2006
Issue Date:	2015-07-21 15:06:11 (UTC+8)
Abstract:	The problem considered in this paper is a flexible flow line with a multiple serial stages, where there are one or more unrelated parallel machines at each stage and there exists a bottleneck stage in the system. The objective of the scheduling problem is to minimize makespan. A bottleneck-based tabu search algorithm is proposed to solve the problem. In order to achieve maximum effectiveness and efficiency of the tabu search algorithm, an efficient bottleneck-focused initial solution and a candidate list strategy are examined in the algorithm. To evaluate the performance of the suggested tabu search algorithm, a traditional tabu search algorithm is investigated for comparison purposes and computational experiments are performed on randomly generated test problems. Results show that the proposed bottleneck-based tabu search algorithm performs well.
Relation:	36th International Conference on Computers and Industrial Engineering, ICC and IE 2006, Pages 568-574
Data Type:	conference
Appears in Collections:	[Department of MIS] Proceedings

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	867	View/Open