A Game Theory Approach for Solving the New Concept of Car Sequencing Problem

The problem of car sequencing is considered in the literature in several contexts. The paper presents different approaches to the issue and introduces new concept of this problem, called Car Sequencing Problem 4.0, which concerns the paint shop. The problem of effective car sequencing in the paint shop results from the specifics of production process itself and from the structure of production line. Sequencing of cars intended to painting process is justified by economic reasons. The main goal is to minimize the number of costly changeovers of painting guns, resulting from color changes and synchronize those with periodic cleanings, forced by technological requirements. For this purpose, a buffer located in the paint shop is applied. In the paper a game-theoretic framework is presented to analyze the considered problem. Two games: Buffer Slot Assignment Game and Buffer-OutShuttle Game in complete context are introduced. Based on the performed simulations it is verified the influence of periodic cleaning interval on the effectiveness of the investigated approach.