Abstract
This paper presents a hybrid search algorithm for scheduling flexible manufacturing systems (FMS). The algorithm combines heuristic Best-First strategy with controlled Backtracking strategy. Timed (place) Petri nets are used for problem representation. Their use allows to explicitly formulate concurrent activities, multiple resources sharing, precedence constraints and dynamic routing in FMS operation. The hybrid heuristic search algorithm is combined with the execution of the timed Petri nets to search for an optimal or near-optimal and deadlock-free schedule. The backtracking strategy is controllable. One can only employ the pure Best-First search to obtain an optimal schedule thanks to a proposed admissible heuristic function. The presented method is illustrated through an FMS scheduling problem.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2793-2797 |
| Number of pages | 5 |
| Journal | Proceedings - IEEE International Conference on Robotics and Automation |
| Volume | 3 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 13th IEEE International Conference on Robotics and Automation. Part 1 (of 4) - Minneapolis, MN, USA Duration: Apr 22 1996 → Apr 28 1996 |
All Science Journal Classification (ASJC) codes
- Software
- Artificial Intelligence
- Electrical and Electronic Engineering
- Control and Systems Engineering