Quang-Vinh Dang
ABSTRACT
Our work addresses the scheduling of mobile robots for transportation and processing of operations on machines in a flexible manufacturing system. Both mobile robots and automated guided vehicles (AGVs) can transport components among machines in the working space. Nevertheless, the difference is that mobile robots considered in this work can process specific value-added operations, which is not possible for AGVs. This new feature increases complexity as well as computational demands. To summarize, we need to compute a sequence of operations on machines, the robot assignments for transportation, and the robot assignments for processing. The main contribution is the proposal of an adaptive large neighborhood search algorithm with the sets of exploration and exploitation heuristics to solve the problem considering makespan minimization. Experimental evaluation is presented on the existing benchmarks. The quality of our solutions is compared to a heuristic based on genetic algorithm and mixed-integer programming proposed recently. The comparison shows that our approach can achieve comparable results in real time which is in order of magnitude faster than the earlier heuristic.1
- W. MacDougall. 2014. Industrie 4.0 smart manufacturing for the future. Germany Trade and Invest. Retrieved from http://belarus.ahk.de/fileadmin/ahk_belarus/Publikationen/GTAI_industrie4.0-smart-manufacturing-for-the-future-en__1_.pdf (2019).Google Scholar
- J. A. Buzacott, D. D. Yao. 1986. Flexible Manufacturing Systems: A Review of Analytical Models. Management Science 32, 7 (1986), 890--905. Google ScholarDigital Library
- C. Schou, R. S. Andersen, D. Chrysostomou, S. Bøgh, and O. Madsen. 2018. Skill-based instruction of collaborative robots in industrial settings. Robotics and Computer-Integrated Manufacturing 53 (2018), 72--80.Google ScholarCross Ref
- R. E. Andersen, E. B. Hansen, D. Cerny, S. Madsen, B. Pulendralingam, S. Bøgh, and D. Chrysostomou. 2017. Integration of a skill-based collaborative mobile robot in a smart cyber-physical environment. Procedia Manufacturing 11 (2017), 114--123.Google ScholarCross Ref
- H. E. Nouri, O. B. Driss, and K. Ghédira. 2016. A Classification Schema for the Job Shop Scheduling Problem with Transportation Resources: State-of-the-Art Review. In Artificial Intelligence Perspectives in Intelligent Systems, R. Silhavy et al. (Eds.). Advances in Intelligent Systems and Computing, Vol 464. Springer, 1--11.Google Scholar
- T. F. Abdelmaguid, A. O. Nassef, B. A. Kamal, and M. F. Hassan. 2004. A hybrid GA/heuristics approach to the simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Research 42, 2 (2004), 267--281.Google ScholarCross Ref
- P. Lacomme, M. Larabi, and N. Tchernev. 2013. Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Economics 143, 1 (2013), 24--34.Google ScholarCross Ref
- J. T. Lin, C. C. Chiu, Y. H. Chang, and H. M. Chen. 2015. A hybrid genetic algorithm for simultaneous scheduling of machines and AGVs in FMS. In Industrial Engineering, Management Science and Applications 2015, M. Gen et al. (Eds.). Springer, Berlin Heidelberg, 277--286.Google Scholar
- H. E. Nouri, O. B. Driss, and K. Ghédira. 2016. Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment. Applied Intelligence 45, 3 (2016), 808--828. Google ScholarDigital Library
- Y. Zheng, Y. Xiao, and Y. Seo. 2014. A tabu search algorithm for simultaneous machine/AGV scheduling problem. International Journal of Production Research 52, 19 (2014), 5748--5763.Google ScholarCross Ref
- L. Deroussi, M. Gourgand, and N. Tchernev. 2008. A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Research 46, 8 (2008), 2143--2164.Google ScholarCross Ref
- F. El Khoukhi, T. Lamoudan, J. Boukachour, and A. E. H. Alaoui. 2011. Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots. ISRN Applied Mathematics (2011), 1--19.Google Scholar
- M. Nageswararao, K. Narayanarao, and G. Ranagajanardhana. 2014. Simultaneous scheduling of machines and AGVs in flexible manufacturing system with minimization of tardiness criterion. Procedia Materials Science 5 (2014), 1492--1501.Google ScholarCross Ref
- M. Mousavi, H. J. Yap, S. N. Musa, F. Tahriri, and S. Z. M. Dawal. 2017. Multi-objective AGV scheduling in an FMS using a hybrid of genetic algorithm and particle swarm optimization. PloS ONE 12, 3 (2017), 1--24.Google ScholarCross Ref
- Q. V. Dang, C. T. Nguyen, and H. Rudová. 2018. Scheduling of mobile robots for transportation and manufacturing tasks. Journal of Heuristics (2018). Google ScholarDigital Library
- S. Ropke and D. Pisinger. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science 40, 4 (2006), 455--472.Google Scholar
- M. Schiffer and G. Walther. 2017. An adaptive large neighborhood search for the location-routing problem with intra-route facilities. Transportation Science 52, 2 (2017), 331--352. Google ScholarDigital Library
- S. Chen, R. Chen, G. G. Wang, J. Gao, and A. K. Sangaiah. 2018. An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. Computers & Electrical Engineering, 67 (2018), 596--607.Google ScholarDigital Library
- T. Carchrae and J. C. Beck. 2005. Cost-based large neighborhood search. In Workshop on the combination of metaheuristic and local search with constraint programming techniques (2005).Google Scholar
- A. A. Kovacs, S. N. Parragh, K. F. Doerner, and R. F. Hartl. 2012. Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling 15, 5 (2012), 579--600. Google ScholarDigital Library
- X. Liu, G. Laporte, Y. Chen, and R. He. 2017. An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time. Computers & Operations Research 86 (2017), 41--53.Google ScholarCross Ref
- D. Pisinger and S. Ropke. 2010. Large Neighborhood Search. In Handbook of Metaheuristics, M. Gendreau (2nd. Eds.). Springer, Boston MA, 399--420.Google Scholar
- U. Bilge and G. Ulusoy. 1995. A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Operations Research 43, 6 (1995), 1058--1070. Google ScholarDigital Library
- A. Santini, S. Ropke, and L. M. Hvattum. 2018. A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic. Journal of Heuristics 24, 5 (2018), 783--815. Google ScholarDigital Library
- B. Goetz. 2004. Java theory and practice: Dynamic compilation and performance measurement. Retrieved from http://www.ibm.com/developerworks/library/j-jtp12214/.Google Scholar
- O. Madsen, S. Bøgh, C. Schou, R. S. Andersen, J. S. Damgaard, M. R. Pedersen, and V. Krüger. 2015. Integration of mobile manipulators in an industrial production. Industrial Robot: An International Journal 42, 1 (2015), 11--18.Google ScholarCross Ref
Index Terms
- Adaptive large neighborhood search for scheduling of mobile robots
Recommendations
Scheduling of mobile robots for transportation and manufacturing tasks
Current manufacturing systems have a tendency to become more and more flexible to adapt to the needs of product diversification. Such a system, e.g. flexible manufacturing system, consists of a number of automatic machines, material handling devices ...
An adaptive large neighborhood search heuristic for the share-a-ride problem
The Share-a-Ride Problem (SARP) aims at maximizing the profit of serving a set of passengers and parcels using a set of homogeneous vehicles. We propose an adaptive large neighborhood search (ALNS) heuristic to address the SARP. Furthermore, we study ...
Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling
We build a novel model of the developed distributing scheduling by supplementing the reentrant characteristic into the model of distributed reentrant permutation flow shop scheduling (DRPFS).We determine the number of factory needs to use, factory ...
Comments