Dept. of Comput. & Inf. Eng., National Taiwan Univ.Liu, Pei-SenPei-SenLiuLI-CHEN FU2007-04-192018-07-052007-04-192018-07-05198910504729http://ntur.lib.ntu.edu.tw//handle/246246/2007041910032173http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032173/1/00100204.pdfhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-0024866826&partnerID=40&md5=7da051bcab9476ae2dd60f7845356cedA approach that can dynamically solve the planning and scheduling problem in a flexible manufacturing system (FMS) is presented. This problem is formulated as the determination of an optimal routing assignment of p automated guided vehicles among m workstations in order to accomplish N tasks in an FMS. A useful task representation called workgraph is introduced to facilitate the latter computation; then the A* search algorithm, the minimax criterion, and source heuristic rules are used to solve this routing assignment problem dynamically. The approach obtains a near-optimal solution in moderate computation time, and, in addition, solves some dynamic situations so as to make the FMS more flexible.application/pdf463276 bytesapplication/pdfen-US[SDGs]SDG9Industrial Plants--Flexible Manufacturing Systems; Mathematical programming, Dynamic; Systems science and cybernetics--Heuristic programming; Vehicles--Navigation systems; Automated Guided Vehicles; Dynamic Routing; Minimax Criterion; Robots, Industrialconference paper10.1109/ROBOT.1989.1002042-s2.0-0024866826http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032173/1/00100204.pdf