摘要
单件车间(Job-Shop)调度问题是一类具有次序约束和资源约束的组合优化问题,是一个典型的NP难题。对Job-shop调度算法的研究不仅是对排序理论的一个补充,而且对于解决单件、多品种、小批量机械制造业的现代化管理也会起到积极的推动作用和影响。文中提出了一种基于剩余函数的Job-shop调度算法(JSSABRF),在初排算法及调解算法的基础上,利用VC与Matlab混合编程实现了该算法。经分析及实验验证,利用这种算法求解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, small batch production mode. This paper presents an improved scheduling algorithm and an adjusting algorithm based on efficiency function to solve job-shop problem, Then these algorithms were operated in combined programming Matlab and Visual C＋＋. Through analyzing and really verifying, the job-shop scheduling results are very satisfactory.
出处
《机械工程师》
2008年第3期122-125,共4页
Mechanical Engineer
基金
哈尔滨市青年科学研究基金(2005AFQXJ034)
