Please use this identifier to cite or link to this item:

Title: Designing a tabu search algorithm for unrelated parallel machines problem with total weighted tardy jobs as the objective
Authors: Chen, Chun-Lung;Chen, Chuen-Lung
Contributors: 資管系
Keywords: Computational experiment;Effectiveness and efficiencies;Initial solution;Sequence dependent setups;Sequence-dependent setup time;Tabu search algorithms;Tardy jobs;Unrelated parallel machines;Industrial engineering;Learning algorithms;Tabu search;Problem solving
Date: 2006
Issue Date: 2015-07-21 15:06:02 (UTC+8)
Abstract: The problem considered in this paper is a set of independent jobs on unrelated parallel machines with sequence-dependent setup times so as to minimize total weighted tardy jobs. A tabu search algorithm is developed to solve the problem. In order to ensure the maximum effectiveness and efficiency of the tabu search algorithm, an effective initial solution and efficient move strategy are proposed to assist in the tabu search. To evaluate the performance of the suggested algorithm, some heuristics rules, such as the earliest weighted due date and the shortest weighted processing time, are examined for comparison purposes. In addition to this, computational experiments are performed on randomly generated test problems. Results show that the proposed tabu search algorithm is a promising method for solving this problem.
Relation: 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006, Pages 1128-1135
Data Type: conference
Appears in Collections:[資訊管理學系] 會議論文

Files in This Item:

File Description SizeFormat

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing