期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 103, 期 2, 页码 873-881出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ijpe.2006.02.011
关键词
production line systems; buffer allocation; combinatorial optimization; metaheuristic; local search; simulated annealing
In this article, we describe a new local search approach for solving the buffer allocation problem in unreliable production lines. In this problem, we need to determine near optimal buffer allocation plans in large production lines and the objective is to maximize the average throughput. An analytical decomposition-type approximation is used to estimate the production line throughput. The proposed approach allows the allocation plan to be calculated subject to a given amount of total buffers slots in a computationally efficient way. Within an acceptable amount of time, our algorithm produced better results than simulated annealing for existing benchmark problems. (c) 2006 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据