考虑非确定加工时间的柔性作业 车间调度问题研究.

Flexible Job-Shop scheduling problem with uncertain processing time has gradually become a new research hotspot in production scheduling. This paper used time Petri net to model interval flexible Job-Shop scheduling problem,then it carried out the reachability analysis based on the state class graph generated by the net model,and calculated all feasible fired sequences. After the timing analysis of these fired sequences,this paper proposed a reverse step method to obtain optimal scheduling strategy for lower(upper) bound of minimum makespan by solving the linear programming problem. Finally,it gave an example to demonstrate the correctness and feasibility of the proposed method. The proposed method can provide an effective solution for the actual interval flexible Job-Shop scheduling problem. [ABSTRACT FROM AUTHOR]