A comprehensive study and analysis on SAT-solvers: advances, usages and achievements

“…This means that it is possible to verify any given solution in polynomial time, but no algorithm exists that can find one such solution in polynomial time. As the algorithm engineering of modern SAT solvers has improved over recent years, the real world running time in the present use case of static scheduling is of negligible importance (Alouneh et al 2019). Weckenborg et al (2020) discussed the automotive capacity scheduling of prototype vehicle production at the Volkswagen Pre-Production Center.…”

Section: Related Workmentioning

confidence: 99%

Flexible scheduling of diagnostic tests in automotive manufacturing

et al. 2022

View full text Add to dashboard Cite

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.

show abstract

“…An inference rule, we might even say, determines the reasoning capability of an ATP system to a great extent. At present, ATP systems for FOL can be divided into three categories according to the inference rules they are based on: 1) ATP systems [7,8] based on tableaux calculus [9]; 2) ATP systems [10][11][12] based on saturation algorithm [13] of binary resolution [14]; 3) ATP systems [15,16] based on SAT/SMT theories [17,18]. Binary resolution proposed by Robinson has become the most well-known inference method due to its simplicity, reliability and efficiency, and research on the ATP systems based on binary resolution is still the mainstream research trend in this field.…”

Section: Introductionmentioning

confidence: 99%

Fully reusing clause deduction algorithm based on standard contradiction separation rule

Liu

et al. 2023

Information Sciences

View full text Add to dashboard Cite

A comprehensive study and analysis on SAT-solvers: advances, usages and achievements

Cited by 15 publications

References 84 publications

Variability modules

Variability modules

Flexible scheduling of diagnostic tests in automotive manufacturing

Fully reusing clause deduction algorithm based on standard contradiction separation rule

Contact Info

Product

Resources

About