Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010 |
Pages | 19-21 |
Number of pages | 3 |
DOIs | |
Publication status | Published - 2010 |
Event | 2010 6th International Conference on Natural Computation, ICNC'10 - Yantai, Shandong, China Duration: 10 Aug 2010 → 12 Aug 2010 |
Publication series
Name | Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010 |
---|---|
Volume | 1 |
Conference
Conference | 2010 6th International Conference on Natural Computation, ICNC'10 |
---|---|
Country/Territory | China |
City | Yantai, Shandong |
Period | 10/08/10 → 12/08/10 |
Keywords
- Complex manufacturing process
- Job shop
- Priority rule
- Production scheduling
Fingerprint
Dive into the research topics of 'A priority rule-based scheduling algorithm for complex manufacturing system'. Together they form a unique fingerprint.Cite this
Miao, W., Li, Z., & Yuan, S. (2010). A priority rule-based scheduling algorithm for complex manufacturing system. In Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010 (pp. 19-21). Article 5582907 (Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010; Vol. 1). https://doi.org/10.1109/ICNC.2010.5582907