A Genetic Algorithm-Based Heuristic for Part-Feeding Mobile Robot Scheduling Problem
This present study deals with the problem of sequencing feeding tasks of a single mobile robot with manipulation arm which is able to provide parts or components for feeders of machines in a manufacturing cell. The mobile robot has to be scheduled in order to keep machines within the cell producing products without any shortage of parts. A method based on the characteristics of feeders and inspired by the (s, Q) inventory system, is thus applied to define time windows for feeding tasks of the robot. The performance criterion is to minimize total traveling time of the robot in a given planning horizon. A genetic algorithm-based heuristic is developed to find the near optimal solution for the problem. A case study is implemented at an impeller production line in a factory to demonstrate the result of the proposed approach.
KeywordsScheduling Mobile Robot Genetic Algorithm Part Feeding
Unable to display preview. Download preview PDF.
- 4.Dang, Q.V., Nielsen, I.E., Steger-Jensen, K.: Scheduling a single mobile robot for feeding tasks in a manufacturing cell. In: Proc. of Int. Conf. Adv. Prod. Manag. Syst., Norway (2011)Google Scholar
- 7.Kats, V., Levner, E.: Parametric algorithms for 2-cyclic robot scheduling with interval processing times. J. Sched. (2010), doi:10.1007/s10951-010-0166-0Google Scholar
- 12.Shyu, J.-H., Liu, A., Kao-Shing, H.: A multi-agent architecture for mobile robot navigation control. In: Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence, pp. 50–57 (1998)Google Scholar