不同交货期时间窗下的平行机生产问题研究

A Study on the Scheduling Problem of Parallel Machines Under the Different Delivery Windows

在工业4.0环境下,满足定制生产需求并能够准时交货的智能工厂成为发展趋势。研究在JIT原则下,考虑订单交货期、到达时间和设备产能资源等约束条件下的平行机生产排序问题,以订单任务提前生产的总时间最小化作为目标,基于历史订单构建虚拟订单进行产品组合,建立交货期约束系统求解模型,使用"最小提前生产时间的启发式算法"进行求解,解决不同交货期约束下平行机生产排序过程中的资源冲突、工期延误、设备浪费等问题,以保证准时交货。最后,使用仿真案例实验验证该方法的可行性,为进一步研究不同交货期时间窗下较大规模的复杂平行机排序问题提供可借鉴的方法。

In the environment of Industry 4.0,intelligent factories which can meet the needs of customized production and ontime delivery are becoming a trend of development.Under the JIT principle,it studies the scheduling problem of parallel machines under the constraint conditions of order delivery time,arrival time and equipment capacity resources,etc.The goal is to minimize the total time of task orders production ahead of time,to make product mix by building virtual orders based on historical ones,and to set up the delivery time constraint system solving model,as well as to use the“minimum heuristic algorithm of early production time”for the solution to the problems of resource conflicting,schedule delaying and equipment wasting in parallel machines scheduling with different lead time constraints and for ensuring delivery on time.Finally,the feasibility of the method is verified by simulation case experiments,which provides a reference method for further research on the scheduling problem of large-scale complex parallel machines under different delivery windows.