考虑不确定因素的单件小批作业计划与调度动态算法

A Job-shop dynamic scheduling algorithm developed by considering uncertain factors

针对单件小批企业在实际生产中存在订单变更和生产现场变化等不确定性因素,导致生产作业的执行与计划存在偏差的问题,提出了一种考虑不确定因素的作业计划与调度动态算法.算法以加工周期最短为目标,对作业计划与调度的变更问题进行求解,通过缩短最长加工路径上的各工序等待时间来缩短加工周期,以调整作业计划,使其适应实际作业调度的需要.通过实例研究,应用该算法进行作业计划的动态调整,能够满足作业计划变更的需求,达到变更目标.

In considering the problem of the deviation between production execution and production planning caused by an uncertain factor in actual single piece and small batch production,a Job-shop dynamic scheduling algorithm developed by considering uncertain factors was proposed.The algorithm could solve the production planning and scheduling change problem with a cost function of minimum Makespan.The algorithm realized the objective of shortening the Makespan by shortening the waiting time of the processes in the longest path;then the new production planning was able to meet the actual scheduling need.The ability of the algorithm was verified through two examples;it met the scheduling change demand and reached the change goal.The algorithm is feasible and effective.