基于剩余函数的单件车间调度算法的研究

Research on Job-shop Scheduling Algorithm Based on Remain Function

单件车间(Job-Shop)调度问题是一类具有次序约束和资源约束的组合优化问题,是一个典型的NP难题。对Job-shop调度算法的研究不仅是对排序理论的一个补充,而且对于解决单件、多品种、小批量机械制造业的现代化管理也会起到积极的推动作用和影响。提出了一种基于剩余函数的Job-shop调度算法(JSSABRF),经分析及实验验证,利用这种算法求解Job-shop调度问题可得到比较满意的结果。

Job-Shop Scheduling Problem is a class of large combinatorial optimum problem with sequence and resources constraints, which is a classical NP-hard. The study of Job-shop scheduling algorithm is not only a supplementary of the scheduling theory, but also has great influence on modernization management in the enterprises with single item, variety products, and small batch production mode. This paper presents a new scheduling algorithm of solving Job-shop problems--Job-Shop Scheduling Algorithm Based on Remain Function（JSSABRF）. which are very satisfactory.