全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于改进降顶算法的非可靠生产线最优缓存分配

DOI: 10.13195/j.kzyjc.2013.0770, PP. 1424-1428

Keywords: 非可靠生产线,缓存分配,蒙特卡罗仿真,禁忌集,降顶算法

Full-Text   Cite this paper   Add to My Lib

Abstract:

缓存分配是生产系统设计中一个重要的优化问题.基于非可靠连续生产线递推分解方法及其统计特性,提出在给定缓冲配制条件下的蒙特卡洛生产线吞吐量仿真估算方法,相比于传统的吞吐量估算模型该方法能更准确地描述各种生产场景.通过构造具有记忆性的禁忌集改进了传统降顶算法,并将其应用于实际缓存最优分配方案搜索中.仿真结果表明,对于各种规模的平衡生产线和非平衡生产线,改进降顶算法都可以快速有效地搜索到最优解.

References

[1]  Nahas N, Ait-Kadi D, Nourelfath M. A new approach for buffer allocation in unreliable production lines[J]. Int J of Production Economics, 2006, 103(2): 873-881.
[2]  Dolgui A, Eremeev A, Sigaev V. HBBA: Hybrid algorithm for buffer allocation in tandem production lines[J]. J of Intelligent Manufacturing, 2007, 18(3): 411-420.
[3]  Nahas N, Nourelfath M, Ait-Kadi D. Ant colonies for structure optimization in a failure prone series—Parallel production system[J]. J of Quality in Maintenance Engineering, 2008, 14(1): 7-33.
[4]  Shi C, Gershwin S. An efficient buffer design algorithm for production line profit maximization[J]. Int J of Production Economics, 2009, 122(2): 725-740.
[5]  Massim Y, Yalaouib F, Amodeob L, et al. Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization[J]. Computers & Operations Research, 2010, 37(4): 611-620.
[6]  Leyla Demir, Semra Tunali, et al. A tabu search approach for buffer allocation in production lines with unreliable machines[J]. Engineering Optimization, 2011, 43(2): 213-231.
[7]  Buzacott J A. Automatic transfer lines with buffer stocks[J]. The Int J of Production Research, 1967, 5(3): 183-200.
[8]  Hillier F S, So K C. The effect of the coefficient of variation of operation times on the allocation of storage space in production line system[J]. IIE Transactions, 1991, 23(2): 198-206.
[9]  Hillier F S, So K C, Boling R W. Notes: Toward characterizing the optimal allocation of storage space in production line systems with variable processing times[J]. Management Science, 1993, 39(1): 126-133.
[10]  Spinellis D, Papadopoulos C T. A simulated annealing approach for buffer allocation in reliable production lines[J]. Annals of Operations Research, 2000, 93(1/2/3/4): 373-384.
[11]  Spinellis D, Papadopoulos C T. Stochastic algorithms for buffer allocation in reliable production lines[J]. Mathematical Problems in Engineering, 2000(5): 441-458.
[12]  Spinellis D, Papadopoulos C T, Macgregor Smith J. Large production line optimization using simulated annealing[J]. Int J of Production Research, 2000, 38(3): 509-541.
[13]  Kirkpatrick S, Gelatt Jr C D, Vecchi M P. Optimization by simulated annealing[J]. Science, 1983, 220(4598): 671-679.
[14]  Van Laarhoven P J M, Aarts E H L. Simulated annealing: Theory and applications[M]. The Netherlands, 1987: 671-679.
[15]  Dallery Y, Frein Y. On decomposition methods for tandem queueing networks with blocking[J]. Operations Research, 1993, 41(2): 386-399.
[16]  Ho Y C, Eyler M A, Chien T T. A gradient technique for general buffer storage design in a production line[J]. Int J of Production Research, 1979, 17(6): 557-580.
[17]  Dolgui A, Eremeev A, Kolokolov A, et al. A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines[J]. J of Mathematical Modeling and Algorithms, 2002, 1(2): 89-104.
[18]  Diamantidis A C, Papadopoulos C T. A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines[J]. Mathematical Problems in Engineering, 2004(3): 209-223.
[19]  Vidalis M, Papadopoulos C, Heavey C. On the workload and phaseload allocation problems of short reliable production lines with finite buffers[J]. Computers & Industrial Engineering, 2005, 48(4): 825-837.
[20]  Allon G, Kroese D P, Raviv T, et al. Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment[J]. Annals of Operations Research, 2005, 134(1): 137-151.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133