Test-Fleet Scheduling in Complex Validation and Production Environments

We present a solution to the complex design-automation problem of scheduling test operations in a validation laboratory or production facility. Our goal is to maximize the utilization of a fleet of test stations and minimize the overall test time for a set of products. We consider the realistic scenario where tests can have dependency graphs, implying that some tests must be completed and passed before others can proceed. We also consider a mix of product types that require different kinds of tests and a mix of testers, which implies that each product can only be tested only on a specific set of testers. To ensure scalability and flexibility, we have formulated this scheduling problem as a “partially observable stochastic game”, a multi-agent extension of a partially observable Markov decision process. We have implemented multi-agent reinforcement learning agents to maximize parallelization in a manner that speeds up both training and inferencing. We present scheduling results for synthetic test cases as well as real-life data from a production facility.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Design Automation of Electronic Systems
Published
2025-07-25
DOI
https://doi.org/10.1145/3749985
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Test-Fleet Scheduling in Complex Validation and Production Environments

Aniruddha Datta, Krishnendu Chakrabarty, Arik Peltz, Bhanu Vikas Yaganti et al.
1 links
ACM Transactions on Design Automation of Electronic Systems
Reinforcement Learning in Robotics
article

Test-Fleet Scheduling in Complex Validation and Production Environments

Aniruddha Datta, Krishnendu Chakrabarty, Arik Peltz, Bhanu Vikas Yaganti, A F Dove, Mate Palocska
article en

Abstract

We present a solution to the complex design-automation problem of scheduling test operations in a validation laboratory or production facility. Our goal is to maximize the utilization of a fleet of test stations and minimize the overall test time for a set of products. We consider the realistic scenario where tests can have dependency graphs, implying that some tests must be completed and passed before others can proceed. We also consider a mix of product types that require different kinds of tests and a mix of testers, which implies that each product can only be tested only on a specific set of testers. To ensure scalability and flexibility, we have formulated this scheduling problem as a “partially observable stochastic game”, a multi-agent extension of a partially observable Markov decision process. We have implemented multi-agent reinforcement learning agents to maximize parallelization in a manner that speeds up both training and inferencing. We present scheduling results for synthetic test cases as well as real-life data from a production facility.

ACM Transactions on Design Automation of Electronic SystemsVol. 30(5)
National Instruments (Ireland) (IE), Amazon (United States) (US), University of Debrecen (HU), Advantest (Singapore) (SG), National Instruments (United States) (US), Arizona State University (US)
Openalex Percentile: Top 90%
Reinforcement Learning in Robotics
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.

Test-Fleet Scheduling in Complex Validation and Production Environments — Aniruddha Datta, Krishnendu Chakrabarty, et al. · ACM Transactions on Design Automation of Electronic Systems (2025) | TGRS Research Map | TGRS