Abstract
In machine job shops with automated guided vehicles (AGVs) as mean of transportation of job parts, it's usually hard to determine the optimal fleet size of AGVs for achieving a desired performance. In this paper a heuristic AGV dispatching algorithm is constructed based on the concept of ideal pipeline and Petri Net theory to balance the job part scheduling and AGV dispatching that minimize the number of AGVs for achieving zero idle time of the machine. The problem is formulated as polynomial equations owing to the mathematical property of Petri Net and since obtaining the optimal solution is computationally difficult, a way to circumvent the difficulty is necessary for the real application of the algorithm. A heuristic dispatching algorithm that schedules the dispatch of AGVs on a selected window basis is used to reduce the computation time and makes the dispatching algorithm capable of real time implementation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
