解决动态作业车间调度关键问题的方法研究

Research on Solving the Key Problem of Dynamic Job Shop Scheduling

计算旧调度方案中用到的各设备的最早可以开始加工时间和确定旧调度方案中尚未完成的加工工序,是解决动态作业车间调度问题的关键,文章研究了相应的解决办法。首先制作了车间工作日历,并具体分配设备任务,为后面的计算打下基础,也提供了一种处理调度结果的方法;然后研究了如何计算旧调度方案中用到的各设备的最早可以开始加工时间和如何确定旧调度方案中尚未完成的加工工序,并提供了具体的算法流程;最后用实例证明了方法及提供的算法流程的有效性。

The key points of solving dynamic job shop scheduling problem are calculating the earliest time that each machine can begin and finding out the unfinished operations of the old scheduling scheme. Relevant solving method is studied, too. First, shop calendar is made and task of each machine is distributed concretely, which are the foundation of the after algorithm and can be used for processing scheduling results. Then the following two points are studied： how to calculate the process of the earliest time that each machine can begin and how to find out the unfinished operations of the old scheduling scheme, concrete algorithms of which are provided. At last, an example demonstrates the validity of the method and the algorithms.