为了对工件搬运作业进行合理规划与调度,提高自动化生产系统的效率,根据工件加工时间约束特征,从不同实际应用中提炼出无等待、有限等待和无限等待三类具有不同计算时间复杂度的自动化生产系统调度问题,系统评述了三类问题的主要研究思路、算法技术以及计算时间复杂度,指出了未来可能的研究方向。
To realize reasonable planning and scheduling of parts transportation and improve efficiency of automatic production systems, according to the constraint feature of parts processing time, the scheduling problem in automa ted production systems from various applications were classified into three types, such as no-wait, limited-wait and indefinite-wait. The main research ideas, algorithm techniques and time complexity calculation of three types were systematically reviewed and summarized, and the future research trends were discussed.