Scheduling Heterogeneous Fleets with Skill and Temporal Synchronisation for Automotive Testing
The increased complexity of vehicle testing can be attributed to the rapid development of technical advancements within the automotive industry, thereby prolonging the time to market of a product. The process of allocating and coordinating vehicle tests at proving grounds (PGs) is a complex and time-consuming task. Currently, this process is still performed manually, which is inefficient. This study proposes a methodology for assigning scenarios to designated sites, taking into account travel aspects between locations and fulfilling participant requirements. The allocation procedure is formulated as an Open Job Shop Scheduling problem with temporal synchronisation and skill matching, and is solved by the Constraint Programming tool Google OR-Tools. The efficacy of the approach is demonstrated by its ability to generate a close-to-optimal schedule to fulfil customer requests. Case studies demonstrate that a combination of two distinct objectives are essential to meet the demands of compactness and time efficiency. The findings of this study provide a solid foundation for enhancing automation at a PG, thereby improving efficiency and optimising testing processes.
Authors
- Robert Fina (ORCID: https://orcid.org/0000-0002-1595-972X)
- Daniel Reischl (ORCID: https://orcid.org/0000-0002-9277-1050)
- Martin Fritz (ORCID: https://orcid.org/0000-0001-9731-8098)
- Andreas Müller (ORCID: https://orcid.org/0000-0003-2127-7335)
- Hubert Gattringer
Institutions
- Johannes Kepler University of Linz (AT)
- Profactor (Austria) (AT)
- Linz Center of Mechatronics (Austria) (AT)
Publication Details
- Published
- 2025-06-22
- DOI
- https://doi.org/10.1109/iv64158.2025.11097588
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Linz Center of Mechatronics