Job－shop多机实时调度的并行算法

A Parallel Algorithm for Real-time Scheduling of Multi-machine Job-shop

本文针对ＭＩＭＤ并行机对一般的Ｊｏｂ－Ｓｈｏｐ调度提出实时调度的并行算法，通过分析复杂性和加速比以及实例，说明并行算法对求大批工件多台机器加工的最优调度的优越性。

n this paper, we point out a parallel algorithm for real-time scheduling of multi-machine Job-shop in MIMD parallel computers. We show the advantage of this parallel algorithm by analyzing the complexity,the speedup and an example.