‘Mover’ a Centralized Job Scheduling and Rapid Routing Solution
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract This paper covers the design, algorithm and simulation of an Automated Guided Vehicle (AGV) designed for Pakistani industries. The AGV is named as ‘Mover’ and it is designed to carry a load of 30Kg in shortest time possible. Two algorithms were studied and implemented to test its overall productivity. Shortest Job First (SJF) schedules maximum number of jobs in given shift time, based on production time of each job on each station. These scheduled jobs then transported to individual workstations using shortest path using A* routing algorithm. The simulation results state that the comparison between a Mover having capabilities of scheduling and shortest part following with manual labour display a difference of around 80% when it comes to efficiency in a production line. Furthermore, the results also that single AGV processed jobs with 95% efficiency while the two labour processed same jobs with 10.85% of efficiency rate
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-29T02:00:03.542394+00:00
License: CC-BY-4.0