Abstract
Flexible manufacturing systems are characterized by versatility and flexibility, but they pose a challenging scheduling problem. Finding optimal fixed schedules is an NP-hard problem, particularly when material movement is automated by shared mechanisms. Alternatively, shared resources can be scheduled in real time by demand, using priority or random selection when choices arise. In a refinement of this type of scheduling, system elements, such as machines, generate requests for shared resources in advance of actually needing them. We call this anticipatory scheduling. This technique is applied to two examples of flexible manufacturing cells: one, a flow shop with a single product type [1], and the other, a flexible manufacturing cell with several possible paths for the multiple job types [2]. Performance was assessed using timed Petri net system models. Results with anticipatory scheduling are promising.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 4131-4136 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
| Volume | 5 |
| State | Published - 1995 |
| Event | Proceedings of the 1995 IEEE International Conference on Systems, Man and Cybernetics. Part 2 (of 5) - Vancouver, BC, Can Duration: Oct 22 1995 → Oct 25 1995 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Hardware and Architecture