4.7 Article

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 155, 期 2, 页码 380-401

出版社

ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(02)00873-1

关键词

flowshop scheduling; parallel machines; buffer constraints; minimizing makespan

向作者/读者索取更多资源

We investigate the problem of scheduling N jobs on parallel machines in L successive stages with limited buffer capacities between stages. The primary objective is to find a schedule that would minimize the makespan. This problem is shown to be NP-hard in the strong sense. We develop a tabu search algorithm for this problem in which the search is limited to the space of permutation vectors of size N. This vector represents the order in which the given set of jobs are performed in the first stage, and we propose a procedure to construct a complete schedule associated with every permutation vector. We conduct an extensive computational experiment using randomly generated instances with different structures and different buffer capacities. We also solve several specific instances of the problem from the open literature. All empirical evidence suggest that the proposed algorithm is an effective method for solving this problem. (C) 2003 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据