针对一种已有的分布式计算理论模型 (单位长度的任务由处理器独立产生 ,没有全局控制 ,彼此通信需要花费时间 ) ,研究了在线性网络上的任务有效调度问题 通过考虑算法中任务处理时间和通信时间之间的平衡 ,给出了一个近似比为 5 88的分布式算法 ,该算法无需全局信息 ,且处理策略简单 对该问题的近似比下界也做了研究 ,证明了该问题不存在近似比小于 1 16的算法 Aiming at an existing theoretical model of distributed computing (in which tasks per unit length are independently generated by the processor and there is no global control and it takes time to communicate with each other), the problem of efficiently scheduling tasks on a linear network is studied by considering the task processing Time and communication time, a distributed algorithm with an approximate ratio of 5 88 is given. The algorithm does not need global information and the handling strategy simply studies the approximation lower than the lower bound. It is proved that the problem is not There is an approximation ratio less than 1 16 algorithm