生产时间可变间歇过程的Petri网模型及其调度

Pteri net model and its scheduling of batch process with variable cycle time

讨论了生产时间可变的多产品间歇过程的最优调度问题,给出了间歇过程在复杂中间的无限存储策略、有限存储策略、无中间存储策略和混杂存储策略下p-时间Petri网模型的描述方法,进而给出了基于可行调度集和修正分枝界定的间歇过程最短生产时间的最优调度算法。该算法利用一间歇过程最短生产时间不大于另一间歇过程最短生产时间的条件,有效地限制了对解空间的搜索,进而改善了算法的计算性能。仿真算例表明了所述方法的有效性。

Optimal scheduling problem of batch process with variable cycle time was discussed. A p time Petri net model description approach for batch process with complicated intermediate storage policies （such as： unlimited intermediate storage, finite intermediate storage, no intermediate storage, and mixed intermediate storage） was presented. Then, an algorithm for short term scheduling of batch process based on a feasible scheduling set and a modified branch ＆ bound was developed. In this method, by applying the condition that the minimal makespan of one batch was not longer than the minimal makespan of the other batch, thereby the explicit enumeration of search was avoided so that the algorithm performance was improved. Effectiveness of the proposed approach and algorithm were demonstrated by simulation.