Petri-Net-Based Scheduling of Flexible Manufacturing Systems Using an Estimate Function

Abstract

In this paper, a novel admissible estimate function is proposed to schedule flexible manufacturing systems (FMSs) by using heuristic search. The FMSs to be scheduled are modeled by P-timed Petri nets. The problem is to make the system evolve from the initial marking to a given final marking by firing a sequence of transitions. The structure of jobs in an FMS is always symmetrical to utilize the shared resources, but the processing time of each job is asymmetrical to reduce the global process time. By utilizing the structural symmetry of a Petri net model of an FMS, a partial reachability graph is generated such that the notorious state explosion problem is mitigated. For each generated marking, the proposed estimate function is used to provide an estimated cost for firing the transition sequence. Then, we can select the marking with the smallest cost from the generated markings and compute its successors. This process is continued until the system reaches the final marking. With the proposed method, the performance is evaluated in terms of the cost of the obtained transition firing sequence and the number of the expanded markings. The cost provided by the proposed estimate function is closer to the optimal cost than the previous work, i.e., the proposed method can find a transition firing sequence with less expanded markings and minimal process time from a marking to the final marking. Experimental results are used to demonstrate and evaluate the proposed approach.

The Petri Net Simulation of Tempeh Processing Prosess With Four Operators

“…Therefore, the job structure utilizes shared resources, but the processing time of each job is not symmetrical. The purpose of flexible manufacturing system scheduling is to determine the assignment of resources in the production process by considering several criteria (eg, time cost and avoidance of deadlocks) [7]. The model obtained in this study is expected to be able to describe the dynamics of these processes and resources.…”

An Internet-of-Things-Based Dynamic Scheduling Optimization Method for Unreliable Flexible Manufacturing Systems under Complex Operational Conditions

“…Moreover, a genetic algorithm was presented to find effective solutions for large-scale scheduling problems. With the objective of finding an optimal transition sequence that minimizes firing time, the authors of [47] proposed a new "admissible heuristic function" for scheduling FMSs utilizing P-timed PNs. Using the structural symmetry of a PN model of an FMS to make a partial reachability graph reduces the state explosion problem as much as possible.…”

A Heuristic Integrated Scheduling Algorithm via Processing Characteristics of Various Machines

“…With the development of intelligent technology and the change of social demand (see Refs. [1][2][3][4][5]), the structure of scheduling products is also diversified (see Refs. [6][7][8][9][10]).…”