Intelligent AGV routing scheduling with applications in semi-conductor production

被引：0
|
作者：
Li K. [1 ]
Liu T. [1 ]
Ruan Y. [2 ]
机构：
[1] School of Management, Huazhong University of Science Technology, Wuhan
[2] Engineering Systems and Design, Singapore University of Technology and Design, Singapore
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2022年 / 28卷 / 09期
关键词：
automated guided vehicle; collision avoidance; intelligent manufacturing; path planning; task scheduling;
D O I：
10.13196/j.cims.2022.09.026
中图分类号：
学科分类号：
摘要：
Under the background of the rapid growth of semiconductor production demand and intelligent manufacturing ,the path planning and scheduling problem of Automated Guided Vehicles (AGVs) was studied in the semi-conductor workshop with the consideration of collision avoidance. On this basis,a two-stage algorithm was proposed. An exact solution based on mathematical model and a task assignment algorithm based on task urgency were used to obtain the tasks' carrying sequence of semiconductors transferred by AGVs. Then,the initial path was generated according to the walking rules of AGVs and the tasks' carrying sequence. A collision detection and avoidance algorithm was further designed to obtain the global AGV conflict-free path planning. A sensitivity analysis for AGV number was done to suggest the optimal number of AGVs in semiconductor intelligent workshop. The experimental results showed that the proposed algorithm could solve the handling of 480 tasks on 4 shelves and between 4 machines. The algorithm was within reasonable time and showed good practicability, which could provide theoretical basis and practical reference for realizing multi-AGVs collaborative scheduling of AGV material handling system in intelligent semiconductor workshop. © 2022 CIMS. All rights reserved.
引用
收藏
页码：2970 / 2980
页数：10
相关论文
共 28 条
  • [1] KUMAR P R., Re-entrant lines[J], Queueing Systems, 13, 1, pp. 87-110, (1993)
  • [2] UZSOY R., Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research, 32, 7, pp. 1615-1635, (1994)
  • [3] HEKMATFAR M, FATEMI GHOMI S M T, KARIMI B., Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan [ J], Applied Soft Computing, 11, 8, pp. 4530-4539, (2011)
  • [4] XIE X, TANG L X, LI Y P., Scheduling of a hub reentrant job shop to minimize makespan, The International Journal of Advanced Manufacturing Technology, 56, 5, pp. 743-753, (2011)
  • [5] GUO C T, JIANG Z B, ZHANG H, Et al., Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system, Computers & Industrial Engineering, 62, 1, pp. 141-151, (2012)
  • [6] JIANG S J, TANG L X., Lagrangian relaxation algorithms for re-entrant hybrid flow shop scheduling [ C], Proceedings of 2008 International Conference on Information Management, Innovation Management and Industrial Engineering, pp. 78-81, (2008)
  • [7] LEE G C, KIM Y D, KIM J G, Et al., A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system, Journal of the Operational Research Society, 54, 10, pp. 1038-1049, (2003)
  • [8] KIM Y D, KANG J H, LEE G E, Et al., Scheduling algorithms for minimizing tardiness of orders at the burn-in workstation in a semiconductor manufacturing system [J], IEEE Transactions on Semiconductor Manufacturing, 24, 1, pp. 14-26, (2011)
  • [9] BARD J F, SRINIVASAN K, TIRUPATI D., An optimization approach to capacity expansion in semiconductor manufacturing facilities[J], International Journal of Production Research, 37, 15, pp. 3359-3382, (1999)
  • [10] KUMAR S, KUMAR P R., Fluctuation smoothing policies are stable for stochastic re-entrant lines [J], Discrete Event Dynamic Systems, 6, 4, pp. 361-370, (1996)
123