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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scheduling Heterogeneous Fleets with Skill and Temporal Synchronisation for Automotive Testing

Robert Fina, Daniel Reischl, Martin Fritz, Andreas Müller et al.
Scheduling and Optimization Algorithms
article

Scheduling Heterogeneous Fleets with Skill and Temporal Synchronisation for Automotive Testing

Robert Fina, Daniel Reischl, Martin Fritz, Andreas Müller, Hubert Gattringer
article en

Abstract

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.

Johannes Kepler University of Linz (AT), Profactor (Austria) (AT), Linz Center of Mechatronics (Austria) (AT)
Linz Center of Mechatronics
Openalex Percentile: Top 72%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Scheduling Heterogeneous Fleets with Skill and Temporal Synchronisation for Automotive Testing — Robert Fina, Daniel Reischl, et al. · (2025) | TGRS Research Map | TGRS