摘要
Production scheduling problem for complex manufacturing system has been the hotspot for research and industry communities. A priority rule-based scheduling algorithm has been proposed in this paper. The scheduling objective of this algorithm is to minimize the makespan, while maximizing the utilization of machines as much as possible. Some priority rules are represented, considering delivery date, number of operations, and processing time. These rules are applied to this proposed algorithm and the simulation results show that the algorithm achieves good results.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010 |
| 页 | 19-21 |
| 页数 | 3 |
| DOI | |
| 出版状态 | 已出版 - 2010 |
| 活动 | 2010 6th International Conference on Natural Computation, ICNC'10 - Yantai, Shandong, 中国 期限: 10 8月 2010 → 12 8月 2010 |
出版系列
| 姓名 | Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010 |
|---|---|
| 卷 | 1 |
会议
| 会议 | 2010 6th International Conference on Natural Computation, ICNC'10 |
|---|---|
| 国家/地区 | 中国 |
| 市 | Yantai, Shandong |
| 时期 | 10/08/10 → 12/08/10 |
指纹
探究 'A priority rule-based scheduling algorithm for complex manufacturing system' 的科研主题。它们共同构成独一无二的指纹。引用此
Miao, W., Li, Z., & Yuan, S. (2010). A priority rule-based scheduling algorithm for complex manufacturing system. 在 Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010 (页码 19-21). 文章 5582907 (Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010; 卷 1). https://doi.org/10.1109/ICNC.2010.5582907