分批次均衡处理的非对称三车间综合调度算法

针对复杂产品在非对称三车间生产调度的问题，提出分批次均衡处理的非对称三车间综合调度算法。该算法先按设备所在车间属性将设备分成非对称资源、局部对称资源和对称资源。对非对称资源上工序根据设备属性确定车间，局部对称和对称资源上可按加工工序采用批次处理，其中部分工序按提出的工序关联策略确定车间，不能确定车间的工序形成缓存集，按提出的排列均衡调整策略确定集中工序的车间。已确定车间工序采用长路径等策略确定调度次序，再根据工序约束条件确定加工时间。通过实例分析，该算法可在二次复杂度内解决非对称三车间综合调度，提高非对称设备利用率。 

An Algorithm of Asymmetric Three Workshops Integrated Scheduling with Batch Equalization Processing

Aiming at the schedule problem of complex products in the asymmetric three workshops, an algorithm was proposed based on batch equalization processing for three workshops integrated scheduling. In the proposed algorithm all devices were classed into three categories, asymmetric, local symmetric and symmetric resources according to workshop attribute that devices belonged to. For the asymmetric resources that the process occupied, the process was assigned to the workshop the device belonged to, and others were adopted according to batch processing. On the one hand a part of processes were following the association process strategy to determine workshop, on the other hand the processes that were uncertain of work-shop, composed a cache set. Then according to balanced arrangement strategy some processes of cache set could conform to a workshop for convergence process. The processes, that had conformed to some workshop, would determine each workshop scheduling order based on long path strategy and so on, and then the processing time were determined according to process constraint conditions. Example analysis results show that the proposed algorithm can improve utilization of asymmetric devices and solve asymmetric three workshops integrated scheduling in the quadratic complexity.