期刊
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
卷 20, 期 3, 页码 199-209出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.rcim.2003.09.001
关键词
flexible manufacturing system; machine loading problem; job sequencing; hybrid tabu-SA; system unbalance
In this article, a machine loading problem of a flexible manufacturing system (FMS) is discussed having the bicriterion objectives of minimizing system unbalance and maximizing throughput in the presence of technological constraints such as available machining time and tool slots. A generic 0-1 integer programming formulation with the objective functions and constraints described above has been proposed. A hybrid algorithm based on tabu search and simulated annealing (SA) is employed to solve the problem. The main advantage of this approach is that a short-term memory provided by the tabu list can be used to avoid revisiting the solution while preserving the stochastic nature of the SA method. The proposed methodology has been tested on ten standard problems and the results obtained are compared with those from sonic of the existing heuristics. (C) 2003 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据