一类面向任务的快速调度算法的研究

An agile-loading algorithm for job-oriented scheduling

为了迅速有效求解作业车间大规模调度问题,克服常规调度算法求解时间长、效率低下、只能适应小规模系统求解的缺点,提出一种基于快速搜索可行调度时间的面向任务的调度算法.该算法依据某一调度目标计算每道工序的可行调度时间,将不同的操作以顺序加工或逆序加工的方式分配至给定能力约束的机器上,通过储存和不断更新每台设备有效调度时间缓冲区的方法,减少工序在每台设备上可行调度的搜索时间,较大地提高了计算效率.仿真结果验证了该算法为解决大规模调度和实时调度问题提供了崭新的思路.

Most etisting algorithms for job-shop scheduling have long-solving time, low efficiency only can be used in small scale system. In order to effectively overcome the deficiency and fast solve large-scale dispatching problems, an agile scheduling time-set based on algorithm for job-oriented scheduling was presented. The algorithm assigned feasible schedule start and finish times to the operations of a job by loading them orderly or conversely onto the capacity constrained machines. The computation time to find the feasible scheduling time-set on the machine was reduced by saving and refreshing each machine＇s buffer. Thus, the computational efficiency was substantially improved. Simulations show that the algorithm has a new access to real-time dispatching and mass production scheduling.