存在设备时间限制的两个企业协同的综合调度算法

针对自有加工企业设备使用时间存在限制无法满足产品交货期的综合调度问题，该文提出存在设备时间限制的两个企业协同的综合调度算法。为了保证自有加工企业能够获得更多的收益，需要将加工任务尽可能多地分配给自有加工企业进行加工。因此，需要将加工任务进行有效分解，首先逆向遍历加工树，将自有加工企业设备使用时间上限作为阈值，设计加工任务分配策略对加工树进行拆分并生成自有加工企业加工的拆分加工树，其余部分为协同加工企业加工的协同加工树。然后设计协同选择策略，在考虑到运输问题并满足交货期的前提下，选取使自有加工企业收益最大的企业为协同加工企业。最后实例分析，该算法可以更好地解决加工企业设备使用时间存在限制并带有交货期和收益的企业车间协同综合调度问题。

Integrated Scheduling Algorithm for Two Corporate Synergies with Equipment Time Constraints

There are restrictions on the use time of equipment in self-owned processing enterprises. This limitation makes the product impossible to complete within the due date of the integrated scheduling problem. To solve this problem, Integrated scheduling algorithm for two corporate synergies with equipment time constraints is proposed. In order to ensure the self-owned processing enterprises can obtain more profits, it is necessary to assign as many processing tasks as possible to the self-owned processing enterprises for processing. Therefore, the processing task needs to be effectively decomposed. First, the processing tree is traversed in reverse direction. The upper limit of equipment use time in self-owned processing enterprise is taken as the threshold value. The processing task assignment strategy is designed to split the processing tree and generate the processing tree of the self-owned processing enterprise and the rest part is the processing tree of the cooperative processing enterprise. The collaborative selection strategy is designed. Under the premise of considering the transportation problem and meeting the delivery time, the cooperative processing enterprise is selected as the enterprise that makes the most profit of the self-owned processing enterprises. The example shows that the algorithm can better solve the problem of integrated scheduling with due date and profit, which is limited by the use time of equipment.