Nash equilibrium as a tool for the Car Sequencing Problem 4.0

This paper introduces a new concept to solve car sequencing problem called the Car Sequencing Problem 4.0, focuses the paint shop. The problem of effective car sequencing in the paint shop is caused by the specifics of the production process itself and the structure of the production line. Sequencing of cars as required by the painting process is justified economically. The main goal is to minimize the number of costly changeovers of the painting guns because of color changes and to synchronize those with periodic cleanings, forced by technological requirements. For this purpose, a buffer located in the paint shop is applied. In this paper a game theoretic framework is presented to analyze the problem. Three games are introduced: Buffer Slot Assignment Game-Buffer-OutShuttle Game called the BSAG-BOSG, In-Out Shuttle Game and its modification called modified In-Out Shuttle Game. Based on the simulations performed the efficiency of the algorithms is verified using several datasets.