Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/313364 
Year of Publication: 
2022
Citation: 
[Journal:] Flexible Services and Manufacturing Journal [ISSN:] 1936-6590 [Volume:] 35 [Issue:] 2 [Publisher:] Springer US [Place:] New York, NY [Year:] 2022 [Pages:] 320-342
Publisher: 
Springer US, New York, NY
Abstract: 
The car of the future will be driven by software and offer a variety of customisation options. Enabling these customisation options forces modern automotive manufacturers to update their standardised scheduling concepts for testing and commissioning cars. A flexible scheduling concept means that every chosen customer configuration code must have its own testing procedure. This concept is essential to provide individual testing workflows where the time and resources are optimised for every car. Manual scheduling is complicated due to constraints on time, predecessor-successor relationships, mutual exclusion criteria, resources and status conditions on the car engineering and assembly line. Applied methods to handle the mathematical formulation for the corresponding industrial optimisation problem and its implementation are not yet available. This paper presents a procedure for automated and non-preemptive scheduling in the testing and commissioning of cars, which is built on a Boolean satisfiability problem on parallel and identical machines with temporal and resource constraints. The presented method is successfully implemented and evaluated on a variant assembly line of an automotive Original Equipment Manufacturer. This paper is the starting point for an automated workflow planning and scheduling process in automotive manufacturing.
Subjects: 
Non-preemptive scheduling
Multiple constraints
Boolean satisfiability problem
Automotive testing
Car manufacturing
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.