基于公理设计的车间调度算法研究

车间调度问题是典型的NP难题,也是一种完全耦合的复杂系统.基于公理设计思想对车间调度系统进行了解耦设计,给出了相应的解耦思路及解耦矩阵,提出并实现了一种车间调度算法,并对算法的复杂性进行了分析.以实际车间生产调度作为研究对象,针对实际生产中零件紧急程度不一的情况,为待加工零件赋予不同的权值,并优先考虑调度加工工时较长的零件;采用以解耦设计为总目标,在满足约束条件的情况下,尽量优化压缩加工时间.对算法的复杂性进行了分析,该算法属于三次多项式复杂级,较优于一般的算法.通过2个实例计算和对比,验证了本算法的实用性和有效性.

Study of job shop scheduling algorithm based on axiomatic design

Job shop scheduling(JSS) is a representative NP question and coupling complicated system.JSS based on axiomatic design was presented and analyzed in detail,such as system decoupling design,approach of decoupling,decoupling matrix,scheduling algorithm and the complexity of the algorithm.The actual production scheduling shop was taken as a research object,and the authors have given machining parts weights based on the urgency situation of parts to be processed,with giving priority to the parts which needs lon...