Abstract
To explicitly formulate concurrent activities, shared resources, precedence constraints and routing flexibility in FMS scheduling, we adopt timed (placed) Petri nets for problem representation. The Bottom-up method is used to synthesize the system, i.e., the system is partitioned into sub-systems according to the job types, sub-models are constructed for each sub-systems, and a complete net model for the entire process is obtained by merging Petri nets of the sub-systems through the places representing the shared resources. Considering each transition in a conflicting set corresponds to each part type which competes for an available resource for next operation, the fuzzy dispatching rules are employed to select one of the enabled transitions to be fired in each conflicting set. They are derived from ordinarily adopted dispatching rules, such as SPT(Shortest Processing Time) and S/RO(Slack per Remaining Operation). An interpretation algorithm using these rules is given and illustrated through an FMS example.
| Original language | English (US) |
|---|---|
| Pages | 309-315 |
| Number of pages | 7 |
| State | Published - 1995 |
| Event | Proceedings of the 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. Part 3 (of 3) - Paris, Fr Duration: Oct 10 1995 → Oct 13 1995 |
Other
| Other | Proceedings of the 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. Part 3 (of 3) |
|---|---|
| City | Paris, Fr |
| Period | 10/10/95 → 10/13/95 |
All Science Journal Classification (ASJC) codes
- General Engineering