摘要
针对加工工序的设备是多台具有相同加工能力的机器集合的非标准Job-Shop调度问题,利用机器负载平衡的思想构造目标函数,提出了非标准Job-Shop调度算法.经对工序加工过程的复杂性分析可知,该算法的时间复杂性较低,试验结果相对其他算法更加优化.
For the nonstandard Job -Shop scheduling problem(NJSSP) in which some operations are processed on several identical machines, by the objective function of machine loads balancing nonstandard scheduling algorithm is presented. Through complexity analysis of operation processes, the algorithm has lower complexity. Experiment indicated that scheduling result of the algorithm compare with the other ways which were solved this kind of problem is optimal.
出处
《哈尔滨理工大学学报》
CAS
2003年第6期31-33,共3页
Journal of Harbin University of Science and Technology
基金
黑龙江省自然科学基金资助(F9914)