TY - GEN
T1 - A priority rule-based scheduling algorithm for complex manufacturing system
AU - Miao, Wenmin
AU - Li, Zhongjun
AU - Yuan, Shukai
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Complex manufacturing process
KW - Job shop
KW - Priority rule
KW - Production scheduling
UR - http://www.scopus.com/inward/record.url?scp=78149301188&partnerID=8YFLogxK
U2 - 10.1109/ICNC.2010.5582907
DO - 10.1109/ICNC.2010.5582907
M3 - Conference contribution
AN - SCOPUS:78149301188
SN - 9781424459612
T3 - Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010
SP - 19
EP - 21
BT - Proceedings - 2010 6th International Conference on Natural Computation, ICNC 2010
T2 - 2010 6th International Conference on Natural Computation, ICNC'10
Y2 - 10 August 2010 through 12 August 2010
ER -