Scheduling AIV transporter using simulation-based supervised learning: A case study on a dynamic job-shop with three workstations

摘要

Dynamic job shop scheduling consists of scheduling jobs dynamically with different routing on a set of machines. A feasible and quick solution can be computed using heuristics. One well-known heuristic in job shop problems is selecting the priority dispatching rule (such as giving priority to the job with the Shortest Processing Time called SPT). Nowadays, with the application of industry 4.0 technologies such as sensors, Intelligent robots, etc., workshop data are more accessible and can be exploited to find the appropriate dispatching rule depending on the state of the shop. This work proposes a data-driven methodology for scheduling an AIV (Autonomous Intelligent Vehicle) that supplies three workstations. Our approach is based on data collected from an Arena simulation model fed to a supervised learning algorithm. This one helps identify one among five dispatching rules for each scheduling decision.