Abstract
A scheduling method that uses Petri net modeling and heuristic search is extended to handle the tool setup. The machine setup is to attach a tool to a particular machine and detach the tool from the machine, and this is a time-consuming activity. The processing time of operations varies according to the attached tool and the machine used. The method proposed in this paper uses timed-transition Petri net to model these features and applies a search algorithm to the reachability of the Petri net model to generate an optimal or near-optimal schedule. In addition, this method can determine how many tools are needed in order to reduce the makespan. Search algorithm employs an evaluation function to guide the search procedure. New heuristic functions are developed for efficient search. The experimental results that show the effectiveness of the proposed method are presented.
| Original language | English |
|---|---|
| Pages (from-to) | 2735-2740 |
| Number of pages | 6 |
| Journal | Proceedings - IEEE International Conference on Robotics and Automation |
| Volume | 4 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 IEEE International Conference on Robotics and Automation, ICRA. Part 4 (of 4) - Albuquerque, NM, USA Duration: 20 Apr 1997 → 25 Apr 1997 |
