前移存在调整时间综合调度工序的算法

Algorithm of Moving Integrated Scheduling Procedures with Set-up Time Forward

针对目前存在调整时间的综合调度算法只考虑快速插入调整时间实现调度方案,没有考虑调整时间会随工序次序改变影响调度结果的问题,提出通过改变工序调度次序前移存在调整时间综合调度工序的算法。该算法在保证相关工序不后移的条件下,通过改变相同加工设备上具有相同工艺紧后工序的工序调度次序,从而改变工序之间的调整时间,使调整工序最晚结束时间提前,使其工艺紧后工序开始时间有可能提前,从而实现提高设备利用率,提前产品最终完工时间。实例表明该算法可获得存在调整时间的综合调度问题的更优解。

The current integrated scheduling algorithms just consider how to realize scheduling plan by inserting set-up time quickly, but not consider the problem that the total set-up time will change along with the changing of scheduling order of procedures, which can influence the scheduling result. Aiming at this problem, integrated scheduling algorithm of shortening total set-up time by changing the scheduling order of procedures is proposed. This algorithm is under the pre-condition of not moving immediately successor procedures backward, reduces the ratio of set-up time in total working hours by changing the scheduling order of procedures with same priority level partly on same machine, and improves the machine utilization efficiency. Example shows this algorithm can obtain the better result of integrated scheduling problem with set-up time in secondary time complexity.