Scheduling tests in automotive R&D projects using a genetic algorithm

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For each car model an automotive manufacturer has to perform hundreds of tests on prototype vehicles before mass production can be started. In this chapter we present heuristic methods for scheduling the individual tests in automotive R & D projects such that the number of required experimental vehicles and hence the testing costs are minimized. The problem at hand can be interpreted as a multi-mode resource-constrained project scheduling problem with minimum and maximum time lags and cumulative resources. We present forward and backward variants of a priority-rule based method as well as a genetic algorithm based on an activity list representation. The presented methods are examined in a comprehensive computational study.

Cite

CITATION STYLE

APA

Bartels, J. H., & Zimmermann, J. (2015). Scheduling tests in automotive R&D projects using a genetic algorithm. In Handbook on Project Management and Scheduling Vol. 2 (pp. 1157–1185). Springer International Publishing. https://doi.org/10.1007/978-3-319-05915-0_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free