TY - GEN
T1 - Applying Dynamic Programming to Test Case Scheduling for Automated Production Systems
AU - Land, Kathrin
AU - Vogel-Heuser, Birgit
AU - Cha, Suhyun
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - In today’s practice, the engineering lifecycle of the manufacturing systems is getting shorter due to frequent requirement changes. Since the manufacturing systems are required to have both – higher availability from a productivity viewpoint and reliability from a safety viewpoint. To check and meet these requirements, quality assurance, typified by testing is one of the significant engineering steps. Though existing test cases can be reused during testing, there also appears a selection problem out of a vast amount of test cases. Especially, it gets more important when the time is extremely limited, e.g. in commissioning and start-up process that is a mandatory process of manufacturing systems or in regression testing. In the previous work, we have presented approaches regarding how to define and determine the utility of test cases. In this paper, we present an efficient test case scheduling approach by applying an optimization algorithm, so called “dynamic programming”. Considering a physical setup time of the mechatronics system within the approach, it becomes more applicable to the practice. Through the numerical experiment results, we also show the superiority and the scalability of the approach in comparison to two different straight-forward scheduling approaches.
AB - In today’s practice, the engineering lifecycle of the manufacturing systems is getting shorter due to frequent requirement changes. Since the manufacturing systems are required to have both – higher availability from a productivity viewpoint and reliability from a safety viewpoint. To check and meet these requirements, quality assurance, typified by testing is one of the significant engineering steps. Though existing test cases can be reused during testing, there also appears a selection problem out of a vast amount of test cases. Especially, it gets more important when the time is extremely limited, e.g. in commissioning and start-up process that is a mandatory process of manufacturing systems or in regression testing. In the previous work, we have presented approaches regarding how to define and determine the utility of test cases. In this paper, we present an efficient test case scheduling approach by applying an optimization algorithm, so called “dynamic programming”. Considering a physical setup time of the mechatronics system within the approach, it becomes more applicable to the practice. Through the numerical experiment results, we also show the superiority and the scalability of the approach in comparison to two different straight-forward scheduling approaches.
KW - Dynamic programming
KW - Test prioritisation model
KW - Test scheduling
UR - http://www.scopus.com/inward/record.url?scp=85094157915&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-58167-1_1
DO - 10.1007/978-3-030-58167-1_1
M3 - Conference contribution
AN - SCOPUS:85094157915
SN - 9783030581664
T3 - Communications in Computer and Information Science
SP - 3
EP - 20
BT - Systems Modelling and Management - 1st International Conference, ICSMM 2020, Proceedings
A2 - Babur, Onder
A2 - Denil, Joachim
A2 - Vogel-Heuser, Birgit
PB - Springer Science and Business Media Deutschland GmbH
T2 - 1st International Conference on Systems Modelling and Management, ICSMM 2020
Y2 - 25 June 2020 through 26 June 2020
ER -