| 引用本文: | 赵千川 郑大钟.串行加工线缓冲器容量次优配置的算法[J].控制理论与应用,1994,11(6):764~769.[点击复制] |
| ZHAO Qianchuan and ZHENG Dazhong.Algorithms of Suboptimal Design of Buffers’ Capacities for Flow Shops[J].Control Theory and Technology,1994,11(6):764~769.[点击复制] |
|
| 串行加工线缓冲器容量次优配置的算法 |
| Algorithms of Suboptimal Design of Buffers’ Capacities for Flow Shops |
| 摘要点击 930 全文点击 403 投稿时间：1992-11-18 修订日期：1993-12-07 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 |
| 1994,11(6):764-769 |
| 中文关键词 串行加工线 阻塞 关键路径 正常化关键路径族 |
| 英文关键词 flow shops blocking critical path nomarlized critical path set |
| 基金项目 |
|
| 中文摘要 |
| 本文考虑加工参数为确定的串行加工线缓冲器容量的设计问题。通过对阻塞问题的研究，得到了加工完成时间和缓冲器容量的定性关系，并提出了次优算法。 |
| 英文摘要 |
| This paper consider design of buffers’ capacities for the flow shops with deterministic parameters.
Based on the results of blocking analysis, the relation between the total production time and the buffers’ capacities is derived and algorithms are proposed for suboptimal design of buffers’ capacities. |