Scheduling of Mobile Robots with Preemptive Tasks
This paper deals with the problem of scheduling of mobile robots taking into account preemption cases in a flexible manufacturing system (FMS). In addition to capability of transporting materials between some machines, mobile robots are able to perform manufacturing tasks at other machines by using their manipulation arms. These manufacturing tasks can be preempted to allow mobile robots to transport materials when needed. The performance criterion is to minimize time required to complete all tasks, i.e. makespan. A mixed-integer programming (MIP) model is formulated to find the optimal solutions for the problem. Numerical experiments are investigated to demonstrate results of the proposed approach.
Keywordspreemptive scheduling mobile robots mixed-integer programming
Unable to display preview. Download preview PDF.
- 4.Bocewicz, G.: Robustness of Multimodal Transportation Networks. Eksploatacja i Niezawodnosc – Maintenance and Reliability 16, 259–269 (2014)Google Scholar
- 7.Dang, Q.-V., Nielsen, I.E., Bocewicz, G.: A Genetic Algorithm-based Heuristic for Part-Feeding Mobile Robot Scheduling Problem. In: Rodríguez, J.M.C., Pérez, J.B., Golinska, P., Giroux, S., Corchuelo, R. (eds.) Trends in PAAMS. AISC, vol. 157, pp. 85–92. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 11.Lacomme, P., Larabi, M., Tchernev, N.: Job-shop Based Framework for Simultaneous Scheduling of Machines and Automated Guided Vehicles. Int. J. Prod. Econ., 24–34 (2013)Google Scholar
- 13.Sitek, P., Wikarek, J.: A Hybrid Method for Modeling and Solving Constrained Search Problems. In: Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 385–392. IEEE Press, Kraków (2013)Google Scholar