Abstract
We introduce a unique scheduling and tool assignment problem that arises for multiple spindle machine tools. The capability of these machines to perform simultaneous operations on one or more parts creates constraints that are not found in the traditional scheduling literature. Two solution methodologies using a genetic algorithm with the random keys encoding are introduced for these problems. One is a hybrid genetic algorithm that incorporates a dispatching rule. The effectiveness of these methods is demonstrated on test problems with comparisons to lower bounds.
| Original language | English |
|---|---|
| Pages | 425-429 |
| Number of pages | 5 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 - Indianapolis, IN, USA Duration: Apr 13 1997 → Apr 16 1997 |
Conference
| Conference | Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 |
|---|---|
| City | Indianapolis, IN, USA |
| Period | 04/13/97 → 04/16/97 |