期刊
COMPUTERS & OPERATIONS RESEARCH
卷 36, 期 3, 页码 907-918出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2007.11.004
关键词
Hybrid flowshop scheduling; Finite intermediate buffer; Tabu search; Scatter search
类别
资金
- National Natural Science Foundation for Distinguished Young Scholars of China [70425003]
- National 863 High-Tech Research and Development Program of China [2006AA04Z174]
- National Natural Science Foundation of China [60674084]
This paper investigates the hybrid flowshop scheduling with finite intermediate buffers. whose objective is to minimize the sum of weighted completion time of all jobs. Since this problem is very complex and has been proven strongly NP-hard, a tabu search heuristic is proposed. In this heuristic there are two main features. One is that a scatter search mechanism is incorporated to improve the diversity of the search procedure. And the other is that a permutation of N jobs representing their processing order in the first stage instead of a complex complete schedule is used to denote a solution. Computational experiments on randomly generated instances with different structures show that the proposed tabu search heuristic can provide good Solutions compared to both the lower bounds and the algorithm proposed for this problem in a lately published literature. (C) 2007 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据