| Tekijä: | Kim, C. W. Tanchoco, J. M. A. |
| Otsikko: | Conflict free shortest time bi-directional AGV routeing (Innerbetrieblicher Transport, Mathematisches Modell) |
| Lehti: | International Journal of Production Research
1991 : DEC, VOL. 29:12, p. 2377-2391 |
| Asiasana: | |
| Vapaa asiasana: | MATERIALFLUSS, TRANSPORTMITTEL, AUTOMATISIERUNG |
| Kieli: | eng |
| Tiivistelmä: | This paper presents an efficient algorithm for finding conflict free shortest time routes for automatically guided vehicles moving in a bi-directional flow path network. The proposed algorithm maintains, for each node, a list of time windows reserved by scheduled vehicles and a list of free time windows available for vehicles to be scheduled. |
SCIMA